Graphs of arbitrary excessive class

DOI10.1016/J.DISC.2010.09.016zbMATH Open1221.05270OpenAlexW2000134389MaRDI QIDQ616357FDOQ616357

Authors: 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

Recommendations

• scientific article; zbMATH DE number 5130724
• An upper bound for the excessive index of an \(r\)-graph
• The excessive [3]-index of all graphs
• On the excessive \([m]\)-index of a tree
• scientific article; zbMATH DE number 3893226

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)

Cites Work

• The equivalence of two conjectures of Berge and Fulkerson
• Blocking and anti-blocking pairs of polyhedra
• On Multi-Colourings of Cubic Graphs, and Conjectures of Fulkerson and Tutte
• Title not available (Why is that?)

Cited In (7)

• On excessive index of certain networks
• An upper bound for the excessive index of an \(r\)-graph
• Excessive \([l, m]\)-factorizations
• 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 index for mesh derived networks

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

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