Bipartite cubic graphs and a shortness exponent

DOI10.1016/0012-365X(83)90201-7MaRDI QIDQ1837702zbMATH OpenOpenAlexWikidataFDO

Authors 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

3-connected bipartite cubic graphsmaximum cyclenon-hamiltonian graphshortness exponent

Mathematics Subject Classification ID

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

Cites work

• Graph theory with applications
• On two-factors of bipartite regular graphs
• Shortness exponents of families of graphs

Cited in

(2)

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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1837702)