An Upper Bound for the Excessive Index of an r‐Graph

DOI10.1002/jgt.21682zbMath1269.05091OpenAlexW1549912818MaRDI QIDQ5325949

Giuseppe Mazzuoccolo

Publication date: 31 July 2013

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

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

zbMATH Keywords

perfect matchingsexcessive index\(r\)-graphsgeneralized Berge-Fulkerson conjecture

Mathematics Subject Classification ID

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

Related Items (7)

Covering a cubic graph with perfect matchings ⋮ Highly edge‐connected regular graphs without large factorizable subgraphs ⋮ On the existence of graphs which can colour every regular graph ⋮ Unions of perfect matchings in \(r\)-graphs ⋮ 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]

Cites Work

• Graphs of arbitrary excessive class
• The equivalence of two conjectures of Berge and Fulkerson
• On Multi-Colourings of Cubic Graphs, and Conjectures of Fulkerson and Tutte
• Indecomposabler-graphs and some other counterexamples
• Blocking and anti-blocking pairs of polyhedra

This page was built for publication: An Upper Bound for the Excessive Index of an r‐Graph