Graphs of arbitrary excessive class

DOI10.1016/J.DISC.2010.09.016zbMath1221.05270OpenAlexW2000134389MaRDI QIDQ616357

Sumit K. Garg

Publication date: 7 January 2011

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2010.09.016

zbMATH Keywords

Berge-Fulkerson conjecture1-factor coverexcessive 1-factorization

Mathematics Subject Classification ID

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

Related Items (7)

An Upper Bound for the Excessive Index of an r‐Graph ⋮ On excessive index of certain networks ⋮ Excessive index for mesh derived networks ⋮ Berge-Fulkerson conjecture on certain snarks ⋮ On the excessive \([m\)-index of a tree] ⋮ On the Complexity of Computing the Excessive [B-Index of a Graph] ⋮ Excessive \([l, m\)-factorizations]

Cites Work

• The equivalence of two conjectures of Berge and Fulkerson
• On Multi-Colourings of Cubic Graphs, and Conjectures of Fulkerson and Tutte
• Blocking and anti-blocking pairs of polyhedra
• Unnamed Item

This page was built for publication: Graphs of arbitrary excessive class