Construction of class two graphs with maximum vertex degree three
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 3648740 (Why is no real title available?)
- scientific article; zbMATH DE number 3654142 (Why is no real title available?)
- scientific article; zbMATH DE number 3616456 (Why is no real title available?)
- scientific article; zbMATH DE number 1534644 (Why is no real title available?)
- scientific article; zbMATH DE number 3102311 (Why is no real title available?)
- Infinite Families of Nontrivial Trivalent Graphs Which are Not Tait Colorable
- Network-Colourings
- On critical graphs with chromatic index 4
- On the edge-chromatic number of a graph
- Polyhedral decompositions of cubic graphs
- Some remarks on the chromatic index of a graph
Cited in
(40)- Snarks of order 18
- Snarks and flow-snarks constructed from coloring-snarks.
- The Fan-Raspaud conjecture: a randomized algorithmic approach and application to the pair assignment problem in cubic networks
- Morphology of small snarks
- On total coloring and equitable total coloring of infinite snark families
- A note on Berge-Fulkerson coloring
- 6-decomposition of snarks
- Chromatic-index-critical graphs of orders 13 and 14
- Petersen cores and the oddness of cubic graphs
- The total-chromatic number of some families of snarks
- Some results on the structure of multipoles in the study of snarks
- Cyclic connectivity, edge-elimination, and the twisted Isaacs graphs
- Sigma coloring on powers of paths and some families of snarks
- On the equitable total chromatic number of cubic graphs
- Fulkerson's conjecture and Loupekine snarks
- Edge reductions in cyclically \(k\)-connected cubic graphs
- Irreducible snarks of given order and cyclic connectivity
- Tutte's edge-colouring conjecture
- Decompositions of Snarks into Repeated Dot-Products
- The circular chromatic index of some Class 2 graphs
- Berge-Fulkerson coloring for some families of superposition snarks
- Classification and characterizations of snarks
- Even cycles and even 2-factors in the line graph of a simple graph
- A brief history of edge-colorings -- with personal reminiscences
- Measures of edge-uncolorability of cubic graphs
- The circular chromatic index of Goldberg snarks
- New results on chromatic index critical graphs
- Rotationally symmetric snarks from voltage graphs
- Computational results and new bounds for the circular flow number of snarks
- The hunting of a snark with total chromatic number 5
- Superposition and constructions of graphs without nowhere-zero k-flows
- scientific article; zbMATH DE number 7228873 (Why is no real title available?)
- \(\lambda\)-numbers of several classes of snarks
- On \(\mathbb{Z}\)-flow-continuous maps and oriented colorings of cubic graphs
- The chromatic index of graphs with large maximum degree
- scientific article; zbMATH DE number 1737273 (Why is no real title available?)
- 3- and 4-critical graphs of small even order
- AVD-total-chromatic number of some families of graphs with \(\Delta(G) = 3\)
- A Möbius-type gluing technique for obtaining edge-critical graphs
- Roman domination and independent Roman domination on graphs with maximum degree three
This page was built for publication: Construction of class two graphs with maximum vertex degree three
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1147159)