Cubic maximal nontraceable graphs
From MaRDI portal
Abstract: We determine a lower bound for the number of edges of a 2-connected maximal nontraceable graph, and present a construction of an infinite family of maximal nontraceable graphs that realize this bound.
Recommendations
- On cubic non-Cayley vertex-transitive graphs
- scientific article; zbMATH DE number 2076930
- On the cubicity of certain graphs
- Maximal nontraceable graphs with toughness less than one
- On non-planarity of cubic graphs
- scientific article; zbMATH DE number 26492
- Decompositions of cubic traceable graphs
- On measures of nonplanarity of cubic graphs
- The cubicity of hypercube graphs
- Cubicity of threshold graphs
Cites work
- scientific article; zbMATH DE number 3652373 (Why is no real title available?)
- scientific article; zbMATH DE number 1409195 (Why is no real title available?)
- Graphs maximal with respect to absence of hamiltonian paths
- On generating snarks
- Smallest claw-free, 2-connected, nontraceable graphs and the construction of maximal nontraceable graphs
- Smallest maximally nonhamiltonian graphs
- Smallest maximally nonhamiltonian graphs. II
- Variations on the Hamiltonian Theme
- Vertices missed by longest paths or circuits
Cited in
(5)- A note on the smallest connected non-traceable cubic bipartite planar graph
- Degree sums of adjacent vertices for traceability of claw-free graphs
- Lower bound for the size of maximal nontraceable graphs
- Further results on maximal nontraceable graphs of smallest size
- Towards obtaining a 3-decomposition from a perfect matching
This page was built for publication: Cubic maximal nontraceable graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q868358)
