A characterization for (A_n;B_n) to be m-graphic

zbMATH Open1348.05054MaRDI QIDQ2829753FDOQ2829753

Authors: Cai Baiguang, Guo Jiyun 

Publication date: 8 November 2016

Published in: International Journal of Applied Mathematics and Statistics (Search for Journal in Brave)

Full work available at URL: http://www.ceser.in/ceserp/index.php/ijamas/article/view/697

Recommendations

• An extension of A.R. Rao's characterization of potentially \(K_{m+1}\)-graphic sequences
• A remark on degree sequences of multigraphs
• A characterization of box-bounded degree sequences of graphs
• Characterizing potentially \(A_{r+1}-mK_2\)-graphic sequences
• Degree sequences of multigraphs

zbMATH Keywords

\(m\)-graphic sequenceChunaphaisan theoremLovász' \((g,f)\)-factor theorem

Mathematics Subject Classification ID

Vertex degrees (05C07) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

This page was built for publication: A characterization for \((A_n;B_n)\) to be \(m\)-graphic

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2829753)