Closures, cycles, and paths

DOI10.1002/jgt.20584zbMath1242.05156OpenAlexW1550858086MaRDI QIDQ2891041

Akira Saito, Arnfried Kemnitz, Jochen Harant, Ingo Schiermeyer

Publication date: 13 June 2012

Published in: Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/jgt.20584

zbMATH Keywords

HamiltoniantraceableHamiltonian-connected

Mathematics Subject Classification ID

Paths and cycles (05C38) Eulerian and Hamiltonian graphs (05C45) Vertex degrees (05C07)

Cites Work

• Unnamed Item
• Degree conditions for Hamiltonicity: counting the number of missing edges
• On k-leaf-connected graphs
• A method in graph theory
• Vertex pancyclic graphs
• A note on Hamiltonian circuits
• The complete closure of a graph
• Note on Hamilton Circuits
• Degree conditions for 2-factors
• Some Theorems on Abstract Graphs

This page was built for publication: Closures, cycles, and paths