Pages that link to "Item:Q2561232"
From MaRDI portal
The following pages link to Shortness exponents of families of graphs (Q2561232):
Displaying 50 items.
- Balanced generic circuits without long paths (Q442309) (← links)
- Circumference of 3-connected claw-free graphs and large Eulerian subgraphs of 3-edge-connected graphs (Q536646) (← links)
- Longest cycles in polyhedral graphs (Q690053) (← links)
- On shortness exponents of families of graphs (Q759158) (← links)
- The number of cycles in 2-factors of cubic graphs (Q804602) (← links)
- An upper bound on the shortness exponent of 1-tough, maximal planar graphs (Q805630) (← links)
- The circumference of a graph with no \(K_{3,t}\)-minor (Q859611) (← links)
- Shortness coefficient of cyclically 5-connected cubic planar graphs (Q1053709) (← links)
- Simple 3-polytopal graphs with edges of only two types and shortness coefficients (Q1071787) (← links)
- Longest cycles in 3-connected cubic graphs (Q1074598) (← links)
- Bipartite regular graphs and shortness parameters (Q1083455) (← links)
- An upper bound on the shortness exponent of inscribable polytopes (Q1122592) (← links)
- Non-Hamiltonian simple 3-polytopes having just two types of faces (Q1145160) (← links)
- Non-Hamiltonian simple 3-polytopes whose faces are all 5-gons or 7-gons (Q1158440) (← links)
- Note on two problems of J. Zaks concerning Hamiltonian 3-polytopes (Q1160192) (← links)
- Shortness parameters of families of regular planar graphs in two or three types of faces (Q1167746) (← links)
- Longest cycles in r-regular r-connected graphs (Q1168983) (← links)
- Shortness exponents for polytopes which are k-gonal modulo n (Q1169478) (← links)
- Problems, problems, problems (Q1175791) (← links)
- Shortness coefficients of simple 3-polytopal graphs with edges of only two types (Q1196756) (← links)
- Pairs of edge-disjoint Hamiltonian circuits (Q1227753) (← links)
- Non-Hamiltonian non-Grinbergian graphs (Q1237752) (← links)
- Remark on a paper of J. Zaks (Q1257908) (← links)
- On shortness coefficients of simple 3-polytopal graphs with only one type of faces besides triangles (Q1322206) (← links)
- A lower bound for the shortness coefficient of a class of graphs (Q1329808) (← links)
- Pentagonal 3-polytopal graphs with edges of only two types and shortness parameters (Q1343788) (← links)
- Graph-theoretical conditions for inscribability and Delaunay realizability (Q1356410) (← links)
- Polyhedral graphs without Hamiltonian cycles (Q1373169) (← links)
- On cubic polyhedral graphs with prescribed adjacency properties of their faces (Q1584409) (← links)
- Long paths and toughness of \(k\)-trees and chordal planar graphs (Q1618219) (← links)
- An update on non-Hamiltonian \(\frac{5}{4}\)-tough maximal planar graphs (Q1690216) (← links)
- Bipartite cubic graphs and a shortness exponent (Q1837702) (← links)
- Long cycles in graphs on a fixed surface (Q1850617) (← links)
- Long cycles in 3-connected graphs (Q1850624) (← links)
- Toughness and Hamiltonicity of a class of planar graphs (Q1883251) (← links)
- \(W_ v\) cycles in plane graphs (Q1900043) (← links)
- Non-hamiltonian \(5 \over 4\)-tough maximal planar graphs (Q1910531) (← links)
- 5-regular 3-polytopal graphs with edges of only two types and shortness exponents less than one (Q1916105) (← links)
- A nonhamiltonian five-regular multitriangular polyhedral graph (Q1916128) (← links)
- On the shortness exponent of 1-tough, maximal planar graphs (Q1918570) (← links)
- The circumference of a graph with no \(K_{3,t}\)-minor. II (Q1931398) (← links)
- Existence and hardness of conveyor belts (Q2209897) (← links)
- Shortness coefficient of cyclically 4-edge-connected cubic graphs (Q2294112) (← links)
- Regular non-Hamiltonian polyhedral graphs (Q2335747) (← links)
- Toughness and nonhamiltonicity of polyhedral graphs (Q2366022) (← links)
- Toughness in graphs -- a survey (Q2494126) (← links)
- Dual circumference and collinear sets (Q2679595) (← links)
- Drawing Planar Graphs with Many Collinear Vertices (Q2961512) (← links)
- Drawing Graphs on Few Lines and Few Planes (Q2961513) (← links)
- On Collinear Sets in Straight-Line Drawings (Q3104785) (← links)
