Bipartite cubic graphs and a shortness exponent

DOI10.1016/0012-365X(83)90201-7zbMath0508.05044OpenAlexW2046168312WikidataQ56001792 ScholiaQ56001792MaRDI QIDQ1837702

Peter J. Owens

Publication date: 1983

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0012-365x(83)90201-7

zbMATH Keywords

shortness exponentmaximum cycle3-connected bipartite cubic graphsnon-hamiltonian graph

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Paths and cycles (05C38) Eulerian and Hamiltonian graphs (05C45)

Related Items (2)

Bipartite regular graphs and shortness parameters ⋮ Decomposable twofold triple systems with non-Hamiltonian 2-block intersection graphs

Cites Work

• On two-factors of bipartite regular graphs
• Shortness exponents of families of graphs
• Unnamed Item

This page was built for publication: Bipartite cubic graphs and a shortness exponent