Minimal Hamiltonian graphs with prescribed degree sets

DOI10.1007/BF01163824zbMath0717.05052OpenAlexW2084514875MaRDI QIDQ753836

A. A. Chernyak

Publication date: 1990

Published in: Mathematical Notes (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01163824

zbMATH Keywords

Hamiltonian graphstraceable graphprescribed vertex-degree set

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The k-factor conjecture is true
• On factorable degree sequences
• Algorithms for constructing graphs and digraphs with given valences and factors
• Degree sets and graph factorizations
• The orders of graphs with prescribed degree sets
• Threshold Sequences
• Degree sets for graphs

This page was built for publication: Minimal Hamiltonian graphs with prescribed degree sets