Two sufficient conditions for a 2-factor in a bipartite graph

DOI10.1002/jgt.3190110102zbMath0651.05053OpenAlexW2107875203MaRDI QIDQ3795704

P. Katerinis

Publication date: 1987

Published in: Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/jgt.3190110102

zbMATH Keywords

2-factor1-tough bipartite graph

Mathematics Subject Classification ID

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

Related Items

Graph factors and factorization: 1985--2003: a survey ⋮ Toughness, hamiltonicity and split graphs ⋮ Unnamed Item ⋮ Binding numbers and \(f\)-factors of graphs ⋮ Toughness in graphs -- a survey ⋮ Bipartite toughness and \(k\)-factors in bipartite graphs ⋮ Connected \(k\)-factors in bipartite graphs

Cites Work

• Unnamed Item