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

zbMATH Open1339.05060MaRDI QIDQ2811705FDOQ2811705

Jiang-Hua Yin, Ji-Yun Guo

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

• Title not available (Why is that?) 👍 👎
• Degree sequences and the existence of \(k\)-factors 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• On a degree sequence analogue of Pósa's conjecture 👍 👎
• Partial parity \((g,f)\)-factors and subgraphs covering given vertex subsets 👍 👎
• Title not available (Why is that?) 👍 👎
• Lovász-Saks-Schrijver ideals and parity binomial edge ideals of graphs 👍 👎
• Title not available (Why is that?) 👍 👎
• Exact Pair Theorem for the ω-Enumeration Degrees 👍 👎

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)