On factorable bigraphic pairs

DOI10.7151/dmgt.2147zbMath1439.05055OpenAlexW2887016607WikidataQ129447859 ScholiaQ129447859MaRDI QIDQ2175236

Shasha Li, Jian Hua Yin

Publication date: 28 April 2020

Published in: Discussiones Mathematicae. Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.7151/dmgt.2147

zbMATH Keywords

Hamiltonian cycledegree sequencebigraphic pair

Mathematics Subject Classification ID

Eulerian and Hamiltonian graphs (05C45) Vertex degrees (05C07)

Cites Work

• Unnamed Item
• A characterization for a graphic sequence to be potentially \(C_{r}\)-graphic
• A theorem on flows in networks
• A short proof of Kundu's k-factor theorem
• The k-factor conjecture is true
• Generalizations of the k-factor theorem
• On factorable degree sequences
• Algorithms for constructing graphs and digraphs with given valences and factors
• Combinatorial Properties of Matrices of Zeros and Ones

This page was built for publication: On factorable bigraphic pairs