Partial parity (g,f)-factors and subgraphs covering given vertex subsets

DOI10.1007/PL00013412zbMATH Open1010.05060OpenAlexW2088622957MaRDI QIDQ5952387FDOQ5952387

Authors: Mikio Kano, Haruhide Matsuda 

Publication date: 9 January 2002

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/pl00013412

Recommendations

• Publication:4731216
• \( (g,f)\)-factors of graphs with prescribed properties
• Odd and even factors with given properties
• More sufficient conditions for a graph to have \((g,f)\)-factors
• Some sufficient conditions for graphs to have (g, f)-factors

Mathematics Subject Classification ID

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

Cited In (3)

• A variation of the classical Lovász's \((g,f)\)-parity factor theorem in degree sequences
• A variation of the partial parity \((g,f)\)-factor theorem due to Kano and Matsuda
• Maximum and optimal 1-2 matching problem of the different kind

This page was built for publication: Partial parity \((g,f)\)-factors and subgraphs covering given vertex subsets

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