Measurements of edge-uncolorability
From MaRDI portal
Publication:1827679
DOI10.1016/J.DISC.2003.05.005zbMATH Open1041.05031OpenAlexW1969424031MaRDI QIDQ1827679FDOQ1827679
Authors: Eckhard Steffen 
Publication date: 6 August 2004
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2003.05.005
Recommendations
Cites Work
- Classification and characterizations of snarks
- Five cycle double covers of some cubic graphs
- Snarks without small cycles
- Infinite Families of Nontrivial Trivalent Graphs Which are Not Tait Colorable
- Title not available (Why is that?)
- Snarks and reducibility
- Parsimonious edge coloring
- A Proof of 4-Coloring the Edges of a Cubic Graph
- The edge chromatic difference sequence of a cubic graph
- Title not available (Why is that?)
Cited In (31)
- Color-character of uncolorable cubic graphs
- Parsimonious edge-coloring on surfaces
- On disjoint matchings in cubic graphs
- On maximum \(k\)-edge-colorable subgraphs of bipartite graphs
- Oddness to resistance ratios in cubic graphs
- Weak oddness as an approximation of oddness and resistance in cubic graphs
- On resistance of graphs
- On snarks that are far from being 3-edge colorable
- Small snarks with large oddness
- Three measures of edge-uncolorability
- Gallai's question and constructions of almost hypotraceable graphs
- Cubic graphs with large circumference deficit
- Some bound of the edge chromatic surplus of certain cubic graphs
- On disjoint matchings in cubic graphs: maximum 2-edge-colorable and maximum 3-edge-colorable subgraphs
- Reducible 3-critical graphs
- On parsimonious edge-colouring of graphs with maximum degree three
- Graphs, disjoint matchings and some inequalities
- The maximum 2-edge-colorable subgraph problem and its fixed-parameter tractability
- 3-critical subgraphs of snarks
- Measures of edge-uncolorability of cubic graphs
- Measures of edge-uncolorability
- Nowhere-zero flows on signed regular graphs
- Coverings of cubic graphs and 3-edge colorability
- Girth, oddness, and colouring defect of snarks
- On Sylvester colorings of cubic graphs
- The smallest nontrivial snarks of oddness 4
- A note on reducing resistance in snarks
- Minimal edge colorings of class 2 graphs and double graphs
- Smallest snarks with oddness 4 and cyclic connectivity 4 have order 44
- Snarks with large oddness and small number of vertices
- Snarks with resistance \(n\) and flow resistance \(2n\)
This page was built for publication: Measurements of edge-uncolorability
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1827679)
