Coverings of cubic graphs and 3-edge colorability

DOI10.7151/dmgt.2194zbMath1453.05106OpenAlexW2906181247WikidataQ128716231 ScholiaQ128716231MaRDI QIDQ2214325

Leonid Plachta

Publication date: 8 December 2020

Published in: Discussiones Mathematicae. Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.7151/dmgt.2194

zbMATH Keywords

resistancecovering of graphsnowhere-zero 4-flowuncolorable cubic graphvoltage permutation graph

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Coloring of graphs and hypergraphs (05C15)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On snarks that are far from being 3-edge colorable
• Measures of edge-uncolorability of cubic graphs
• Edge reductions in cyclically \(k\)-connected cubic graphs
• Generating all graph coverings by permutation voltage assignments
• Measurements of edge-uncolorability
• Snarks without small cycles
• Small snarks with large oddness
• The circular chromatic index of Goldberg snarks
• Irreducible snarks of given order and cyclic connectivity
• Decompositions and reductions of snarks
• Relating embedding and coloring properties of snarks

This page was built for publication: Coverings of cubic graphs and 3-edge colorability