Chords of longest cycles in cubic graphs
From MaRDI portal
Publication:1386433
DOI10.1006/jctb.1997.1776zbMath0905.05047MaRDI QIDQ1386433
Publication date: 14 January 1999
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1006/jctb.1997.1776
Related Items
Independent dominating sets and a second hamiltonian cycle in regular graphs, Vertices of small degree in uniquely Hamiltonian graphs
Cites Work
- Cycles in graphs. (Workshop Cycles in Graphs held at Simon Fraser University, Burnaby, British Columbia, Canada, July 5 - August 20, 1982)
- Colorings and orientations of graphs
- A solution to a colouring problem of P. Erdős
- On the Number of Hamiltonian Cycles in Bipartite Graphs
- Uniqueness of maximal dominating cycles in 3‐regular graphs and of hamiltonian cycles in 4‐regular graphs
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item