An upper bound for the excessive index of an r-graph

DOI10.1002/JGT.21682MaRDI QIDQ5325949zbMATH OpenOpenAlexFDO

Authors G. 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)

Recommendations

• Unions of 1-factors in \(r\)-graphs and overfull graphs
• Some results of minimum sets of 1-factors covering a graph
• Unions of perfect matchings in \(r\)-graphs
• A generalisation of matching and colouring
• Coverings of r—graphs by complete r—partite subgraphs

Cites work

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

Cited in

(12)

• Covering a cubic graph with perfect matchings
• Graphs of arbitrary excessive class
• Berge-Fulkerson conjecture on certain snarks
• Unions of perfect matchings in \(r\)-graphs
• Highly edge‐connected regular graphs without large factorizable subgraphs
• On the excessive \([m]\)-index of a tree
• Unions of 1-factors in \(r\)-graphs and overfull graphs
• On the complexity of computing the excessive \([B]\)-index of a graph
• Corrigendum to: ``Unions of 1-factors in \(r\)-graphs and overfull graphs
• On the existence of graphs which can colour every regular graph
• scientific article; zbMATH DE number 6982150 (Why is no real title available?)
• Some results of minimum sets of 1-factors covering a graph

This page was built for publication: An upper bound for the excessive index of an \(r\)-graph

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