Shortness exponents of families of graphs

DOI10.1016/0097-3165(73)90012-5zbMath0263.05103OpenAlexW2027269133WikidataQ56603445 ScholiaQ56603445MaRDI QIDQ2561232

Hansjoachim Walther, Branko Grünbaum

Publication date: 1973

Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0097-3165(73)90012-5

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Planar graphs; geometric and topological aspects of graph theory (05C10) Polytopes and polyhedra (52Bxx)

Related Items

A lower bound for the shortness coefficient of a class of graphs, Long paths and toughness of \(k\)-trees and chordal planar graphs, Bipartite regular graphs and shortness parameters, Toughness and nonhamiltonicity of polyhedral graphs, Toughness and Hamiltonicity of a class of planar graphs, Pentagonal 3-polytopal graphs with edges of only two types and shortness parameters, On the toughness index of planar graphs, Unnamed Item, Graph-theoretical conditions for inscribability and Delaunay realizability, \(W_ v\) cycles in plane graphs, The circumference of a graph with no \(K_{3,t}\)-minor, Non-hamiltonian \(5 \over 4\)-tough maximal planar graphs, Polyhedral graphs without Hamiltonian cycles, 5-regular 3-polytopal graphs with edges of only two types and shortness exponents less than one, A nonhamiltonian five-regular multitriangular polyhedral graph, On the shortness exponent of 1-tough, maximal planar graphs, An upper bound on the shortness exponent of inscribable polytopes, The circumference of a graph with no \(K_{3,t}\)-minor. II, Dual circumference and collinear sets, On 3‐polytopes with non‐Hamiltonian prisms, An update on non-Hamiltonian \(\frac{5}{4}\)-tough maximal planar graphs, Non-Hamiltonian simple 3-polytopes having just two types of faces, Drawing Planar Graphs with Many Collinear Vertices, Drawing Graphs on Few Lines and Few Planes, Non-Hamiltonian simple 3-polytopes whose faces are all 5-gons or 7-gons, Balanced generic circuits without long paths, Note on two problems of J. Zaks concerning Hamiltonian 3-polytopes, Existence and hardness of conveyor belts, Shortness parameters of families of regular planar graphs in two or three types of faces, Longest cycles in r-regular r-connected graphs, Shortness exponents for polytopes which are k-gonal modulo n, Problems, problems, problems, Shortness coefficients of simple 3-polytopal graphs with edges of only two types, Longest cycles in polyhedral graphs, Circumference of 3-connected claw-free graphs and large Eulerian subgraphs of 3-edge-connected graphs, Toughness in graphs -- a survey, Acyclic colorings of planar graphs, Pairs of edge-disjoint Hamiltonian circuits, Unnamed Item, Non-Hamiltonian non-Grinbergian graphs, Shortness coefficient of cyclically 4-edge-connected cubic graphs, Remark on a paper of J. Zaks, Unnamed Item, On shortness exponents of families of graphs, Unnamed Item, On Collinear Sets in Straight-Line Drawings, Unnamed Item, Bipartite cubic graphs and a shortness exponent, Unnamed Item, On cubic polyhedral graphs with prescribed adjacency properties of their faces, Regular non-Hamiltonian polyhedral graphs, Shortness coefficient of cyclically 5-connected cubic planar graphs, Unnamed Item, Long cycles in graphs on a fixed surface, Long cycles in 3-connected graphs, The number of cycles in 2-factors of cubic graphs, An upper bound on the shortness exponent of 1-tough, maximal planar graphs, Simple 3-polytopal graphs with edges of only two types and shortness coefficients, On shortness coefficients of simple 3-polytopal graphs with only one type of faces besides triangles, Longest cycles in 3-connected cubic graphs

Cites Work