Some remarks about factors of graphs

DOI10.1002/JGT.20284zbMath1163.05048DBLPjournals/jgt/CorreaM08OpenAlexW4244088687WikidataQ65553915 ScholiaQ65553915MaRDI QIDQ5387016

José R. Correa, Martin Matamala

Publication date: 14 May 2008

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

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

zbMATH Keywords

graph theoryfactors

Mathematics Subject Classification ID

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

Related Items (12)

Discussion on fractional \((a, b, k)\)-critical covered graphs ⋮ A degree condition for fractional \((g, f, n)\)-critical covered graphs ⋮ Independence number, connectivity and all fractional \((a, b, k)\)-critical graphs ⋮ Equitable factorizations of edge-connected graphs ⋮ A new neighborhood condition for graphs to be fractional \((k,m)\)-deleted graphs ⋮ Edge Coloring and Decompositions of Weighted Graphs ⋮ On all fractional \({(a,b,k)}\)-critical graphs ⋮ Excessive index for mesh derived networks ⋮ Minimum vertex weighted deficiency of \((g,f)\)-factors: A greedy algorithm ⋮ A sufficient condition for graphs to be fractional \((k,m)\)-deleted graphs ⋮ Toughness condition for the existence of all fractional \((a, b, k)\)-critical graphs ⋮ A NEIGHBOURHOOD CONDITION FOR GRAPHS TO BE FRACTIONAL (k, m)-DELETED GRAPHS

Cites Work

• An edge-coloration theorem for bipartite graphs with applications
• Combinatorial optimization. Polyhedra and efficiency (3 volumes)
• The Factors of Graphs

This page was built for publication: Some remarks about factors of graphs