Spanning cycles of nearly cubic graphs

DOI10.1016/0095-8956(80)90087-8zbMath0387.05017OpenAlexW2088096994MaRDI QIDQ1250225

Roger Entringer, Henda C. Swart

Publication date: 1980

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0095-8956(80)90087-8

zbMATH Keywords

nearly cubic graphsspanning cycles

Mathematics Subject Classification ID

Paths and cycles (05C38) Graph theory (05C99) Eulerian and Hamiltonian graphs (05C45)

Related Items

A history of mathematics in South Africa: modern milestones, On common edges in optimal solutions to traveling salesman and other optimization problems, Regular Graphs with Few Longest Cycles, Hamilton cycles in infinite cubic graphs, The signed edge-domatic number of nearly cubic graphs, A degree constraint for uniquely Hamiltonian graphs, A lower bound for the smallest uniquely Hamiltonian planar graph with minimum degree three, Independent dominating sets and a second hamiltonian cycle in regular graphs, Cycles of many lengths in Hamiltonian graphs, Long cycles in Hamiltonian graphs, What is on his mind?, On the Number of Hamiltonian Cycles in Bipartite Graphs, Unnamed Item, Graphs with few hamiltonian cycles, Vertices of small degree in uniquely Hamiltonian graphs, On uniquely Hamiltonian claw-free and triangle-free graphs, Uniquely Hamiltonian Graphs of Minimum Degree 4

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Un grafo cubico, non-planare, unicamente tricolorabile, di vita 5
• ON THE CHROMATIC INDEX OF A GRAPH, III: UNIQUELY EDGE-COLOURABLE GRAPHS
• Hamiltonian Cycles and Uniquely Edge Colourable Graphs
• On Hamiltonian Circuits