Perfect Matching Index versus Circular Flow Number of a Cubic Graph

DOI10.1137/20M1359407zbMath1467.05101arXiv2008.04775OpenAlexW3169944753MaRDI QIDQ4997131

Martin Škoviera, Edita Máčajová

Publication date: 28 June 2021

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

Full work available at URL: https://arxiv.org/abs/2008.04775

zbMATH Keywords

coveringcubic graphcircular flowsnarkperfect matching

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Coloring of graphs and hypergraphs (05C15) Flows in graphs (05C21)

Related Items (4)

Ban–Linial's Conjecture and treelike snarks ⋮ Deciding whether four perfect matchings can cover the edges of a snark is NP-complete ⋮ Some snarks are worse than others ⋮ Cubic graphs that cannot be covered with four perfect matchings

Cites Work

• Sparsely intersecting perfect matchings in cubic graphs
• Generation and properties of snarks
• Measures of edge-uncolorability of cubic graphs
• Treelike snarks
• A note on Fouquet-Vanherpes question and Fulkerson conjecture
• Circular flow numbers of regular multigraphs
• On Cubic Bridgeless Graphs Whose Edge-Set Cannot be Covered by Four Perfect Matchings
• On Multi-Colourings of Cubic Graphs, and Conjectures of Fulkerson and Tutte
• On (k,d)-colorings and fractional nowhere-zero flows

This page was built for publication: Perfect Matching Index versus Circular Flow Number of a Cubic Graph