A variation of the classical Lovász's (g,f)-parity factor theorem in degree sequences

MaRDI QIDQ2811705zbMATHFDO

Authors Ji-Yun Guo, Jiang-Hua Yin

Publication date 10 June 2016

Published in Utilitas Mathematica (Search for Journal in Brave)

zbMATH Keywords

degree sequenceparity graphicLovász's \((g,f)\)-parity factor theorem

Mathematics Subject Classification ID

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

Recommendations

• A variation of the partial parity \((g,f)\)-factor theorem due to Kano and Matsuda
• Degree sequences and the existence of \(k\)-factors
• Publication:4862225
• scientific article; zbMATH DE number 998051
• On a degree sequence analogue of Pósa's conjecture
• Partial parity \((g,f)\)-factors and subgraphs covering given vertex subsets
• A variant of Niessen's problem on degree sequences of graphs
• Lovász-Saks-Schrijver ideals and parity binomial edge ideals of graphs
• scientific article; zbMATH DE number 3096112
• Exact Pair Theorem for the ω-Enumeration Degrees

Cited in

(2)

• A variant of Niessen's problem on degree sequences of graphs
• A variation of the partial parity \((g,f)\)-factor theorem due to Kano and Matsuda

This page was built for publication: A variation of the classical Lovász's \((g,f)\)-parity factor theorem in degree sequences

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