Measures of edge-uncolorability of cubic graphs
From MaRDI portal
Publication:668025
zbMath1409.05086arXiv1702.07156MaRDI QIDQ668025
Publication date: 5 March 2019
Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1702.07156
Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Structural characterization of families of graphs (05C75) Coloring of graphs and hypergraphs (05C15) Flows in graphs (05C21)
Related Items (19)
Snarks with resistance \(n\) and flow resistance \(2n\) ⋮ 3-critical subgraphs of snarks ⋮ Girth, oddness, and colouring defect of snarks ⋮ Cubic graphs with colouring defect 3 ⋮ A note on reducing resistance in snarks ⋮ Flow resistance to resistance ratios in cubic graphs ⋮ Reducible 3-critical graphs ⋮ Some snarks are worse than others ⋮ Coverings of cubic graphs and 3-edge colorability ⋮ Superposition of snarks revisited ⋮ Critical and flow-critical snarks coincide ⋮ An equivalent formulation of the Fan-Raspaud Conjecture and related problems ⋮ Measures of edge-uncolorability of cubic graphs ⋮ Partially normal 5-edge-colorings of cubic graphs ⋮ The smallest nontrivial snarks of oddness 4 ⋮ Smallest snarks with oddness 4 and cyclic connectivity 4 have order 44 ⋮ Perfect Matching Index versus Circular Flow Number of a Cubic Graph ⋮ Normal 5-edge-colorings of a family of Loupekhine snarks ⋮ Morphology of small snarks
Uses Software
Cites Work
- On the strong circular 5‐flow conjecture
- Avoiding 5-Circuits in 2-Factors of Cubic Graphs
- Relating embedding and coloring properties of snarks
- On the algebraic theory of graph colorings
- Maximum matching and a polyhedron with 0,1-vertices
- Polyhedral decompositions of cubic graphs
- Blocking and anti-blocking pairs of polyhedra
- Network-Colourings
- On the Imbedding of Linear Graphs in Surfaces
- A Contribution to the Theory of Chromatic Polynomials
- Tutte's 5-flow conjecture for highly cyclically connected cubic graphs
- On cycle-double covers of graphs of small oddness
- Nowhere-zero \(k\)-flows of supergraphs
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On snarks that are far from being 3-edge colorable
- The structure of graphs with circular flow number 5 or more, and the complexity of their recognition problem
- A faster test for 4-flow-criticality in snarks
- A new proof of Seymour's 6-flow theorem
- Covering a cubic graph with perfect matchings
- Sparsely intersecting perfect matchings in cubic graphs
- Nearly nowhere-zero \(r\)-flow graphs
- Generation and properties of snarks
- Parity subgraphs with few common edges and nowhere-zero 5-flow
- Intersecting 1-factors and nowhere-zero 5-flows
- Three measures of edge-uncolorability
- On resistance of graphs
- Measures of edge-uncolorability
- Measures of edge-uncolorability of cubic graphs
- Treelike snarks
- Zulässige Kantenfärbungen von pseudo-regulären Graphen 3. Grades mit der Kantenfarbenzahl 3
- Computational results and new bounds for the circular flow number of snarks
- Constructing hypohamiltonian snarks with cyclic connectivity 5 and 6
- On embeddings of snarks in the torus
- Smallest counterexample to the 5-flow conjecture has girth at least eleven
- Color-character of uncolorable cubic graphs
- Approximating the maximum 3-edge-colorable subgraph problem
- Construction of class two graphs with maximum vertex degree three
- Note sur la non existence d'un snark d'ordre 16
- Nowhere-zero 6-flows
- Snarks of order 18
- A construction of 3-connected graphs
- Fulkerson's conjecture and circuit covers
- A cyclically 6-edge-connected snark of order 118
- The construction and reduction of strong snarks
- Reduction of the 5-flow conjecture to cyclically 6-edge-connected snarks.
- Snarks and flow-snarks constructed from coloring-snarks.
- Classification and characterizations of snarks
- Oddness to resistance ratios in cubic graphs
- Weak oddness as an approximation of oddness and resistance in cubic graphs
- 6-decomposition of snarks
- Special classes of snarks
- Measurements of edge-uncolorability
- Graphes cubiques d'indice trois, graphes cubiques isochromatiques, graphes cubiques d'indice quatre
- Five cycle double covers of some cubic graphs
- Parsimonious edge coloring
- Snarks without small cycles
- Some results on the structure of multipoles in the study of snarks
- Small snarks with large oddness
- Some remarks on the chromatic index of a graph
- Girth six cubic graphs have Petersen minors
- On the maximum fraction of edges covered by \(t\) perfect matchings in a cubic bridgeless graph
- On parsimonious edge-colouring of graphs with maximum degree three
- Factorisation of snarks
- Cyclically five-connected cubic graphs
- A note on Fouquet-Vanherpes question and Fulkerson conjecture
- Odd 2-factored snarks
- A simple and fast heuristic algorithm for edge-coloring of graphs
- On disjoint matchings in cubic graphs: maximum 2-edge-colorable and maximum 3-edge-colorable subgraphs
- Fulkerson's conjecture and Loupekine snarks
- Irreducible snarks of given order and cyclic connectivity
- Berge-Fulkerson conjecture on certain snarks
- Circular flow numbers of regular multigraphs
- A remark on Petersen coloring conjecture of Jaeger
- On Cubic Bridgeless Graphs Whose Edge-Set Cannot be Covered by Four Perfect Matchings
- Petersen Cores and the Oddness of Cubic Graphs
- Snarks with given real flow numbers
- The equivalence of two conjectures of Berge and Fulkerson
- Petersen-colorings and some families of snarks
- A Class Of Abelian Groups
- On Perfect Matching Coverings and Even Subgraph Coverings
- Flow-Critical Graphs
- Polyhedral embeddings of snarks in orientable surfaces
- Decomposition of snarks
- The NP-Completeness of Edge-Coloring
- Infinite Families of Nontrivial Trivalent Graphs Which are Not Tait Colorable
- On Multi-Colourings of Cubic Graphs, and Conjectures of Fulkerson and Tutte
- On (k,d)-colorings and fractional nowhere-zero flows
- Cyclically 5-edge connected non-bicritical critical snarks
- On hypohamiltonian snarks and a theorem of Fiorini
- Decompositions and reductions of snarks
- 1‐Factor and Cycle Covers of Cubic Graphs
- Cycle‐Continuous Mappings—Order Structure
- Nowhere‐Zero 5‐Flows On Cubic Graphs with Oddness 4
- A Proof of 4-Coloring the Edges of a Cubic Graph
- The Generation of Fullerenes
This page was built for publication: Measures of edge-uncolorability of cubic graphs
