Construction of Hamiltonian graphs and bigraphs with prescribed degrees
From MaRDI portal
Publication:1251235
DOI10.1016/0095-8956(78)90016-3zbMath0391.05039OpenAlexW2030482726MaRDI QIDQ1251235
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
Related Items
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