On a Goodman – Hedetniemi Sufficient Condition for the Graph Hamiltonicity

DOI10.18500/1816-9791-2018-18-3-347-353zbMath1406.05058OpenAlexW2891096121MaRDI QIDQ3120260

M. B. Abrosimov

Publication date: 1 March 2019

Published in: Izvestiya of Saratov University. New Series. Series: Mathematics. Mechanics. Informatics (Search for Journal in Brave)

Full work available at URL: http://mathnet.ru/eng/isu769

zbMATH Keywords

Hamiltonian graphforbidden subgraphs

Mathematics Subject Classification ID

Eulerian and Hamiltonian graphs (05C45)

Related Items (1)

COMPARISON OF SUFFICIENT DEGREE BASED CONDITIONS FOR HAMILTONIAN GRAPH

Cites Work

• Unnamed Item
• Unnamed Item
• Generalizations of Dirac's theorem in Hamiltonian graph theory -- a survey
• Arc coverings of graphs
• New sufficient conditions for cycles in graphs
• Neighbourhood unions and Hamiltonian properties in graphs
• A method in graph theory
• Sufficient conditions for a graph to be Hamiltonian
• On Hamilton's ideals
• Note on Hamilton Circuits
• Updating the hamiltonian problem—A survey
• Some Theorems on Abstract Graphs

This page was built for publication: On a Goodman – Hedetniemi Sufficient Condition for the Graph Hamiltonicity