Construction of Hamiltonian graphs and bigraphs with prescribed degrees

DOI10.1016/0095-8956(78)90016-3zbMath0391.05039OpenAlexW2030482726MaRDI QIDQ1251235

V. Chungphaisan

Publication date: 1978

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(78)90016-3

zbMATH Keywords

BigraphsHamiltonian GraphsLaying-Off AlgorithmPrescribed Degrees

Mathematics Subject Classification ID

Graph theory (05C99) Eulerian and Hamiltonian graphs (05C45)

Related Items

Graphs and degree sequences. I

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A theorem on flows in networks
• The k-factor conjecture is true
• On factorable degree sequences
• Algorithms for constructing graphs and digraphs with given valences and factors
• A remark on the existence of finite graphs
• On Realizability of a Set of Integers as Degrees of the Vertices of a Linear Graph. I
• Sequences Realizable by Graphs with Hamiltonian Squares