Trestles in the squares of graphs

A Kabela, J Teska - Discrete Mathematics, 2021 - Elsevier
square of every connected S ( K 1 , 4 ) -free graphsquare has a 2-connected spanning
subgraph of maximum degree at most k. This generalises the results on S ( K 1 , 3 ) -free graphs

Design of a Two-Lane Highway Bridge and Trestle

JJ Fiala - 1946 - search.proquest.com
… Several methods are available for finding the horizontal displacements, only two of which
will be used here, the one a graph ical solution by means of a Williot diagram, the other an …

TRESTLE IN THE SQUARE OF A GRAPH

A Kabela, J Teska - cid.uz.zgora.pl
… For any integer r > 1, an r-trestle is a 2-connected graph F with maximum degree ∆(F) ≤ r.
We say that a graph G has an r-trestle if G contains a spanning subgraph which is an r-trestle. …

Graphical fisheye views of graphs

M Sarkar, MH Brown - Proceedings of the SIGCHI conference on Human …, 1992 - dl.acm.org
… and browsing graphs. A fisheye view of agraph shows an area of interest quite large and with
detail, and shows the remainder of the graph … This project was the first Trestle application …

[PDF][PDF] Toughness and Hamiltonicity of graphs

MA Kabela - core.ac.uk
square of a graph and its relation to Hamiltonicity and toughness. We let G2 denote the
square of a graph G, that is, the graph … ; namely, the existence of k-factors, k-walks and k-trestles, …

[PDF][PDF] Graphs and subgraphs with bounded degree

J Teska - 2008 - core.ac.uk
… We say that a graph G has an r-trestle if G contains a spanning subgraph which is an rtrestle
In particular, the graphs G2 and G3 are called the square and cube of G, respectively. Figure …

[PDF][PDF] Assessment of the straightness condition of the overhead crane trestle in a steel structure

R Kubicki, M Mrówczyńska - 2018 - zbc.uz.zgora.pl
… of squares of beam axles deviations from their designed axles. … , a graph is made, on which
the theoretical axis of the track is marked with a centred straight line (Fig. 2). Using this graph, …

Graph coarsening for runtime improvements in the maximum concurrent flow problem

FE Vilas, E Olinick, D Matula - 2018 AIAA Information Systems-AIAA …, 2018 - arc.aiaa.org
graphs, 500 random geometric graphs on the unit square, and 400 random geometric …
trestle graph, while maintaining the same MCFP throughput of 0.03125. Since the trestle graph

[CITATION][C] Factors and cycles in graphs

J Teska - 2008 - Ph. D. Thesis, University of West …

[CITATION][C] Zobecněné hamiltonovské kružnice

A Kabela - 2012 - Západočeská univerzita v Plzni