Construction of class two graphs with maximum vertex degree three
From MaRDI portal
Publication:1147159
DOI10.1016/0095-8956(81)90030-7zbMath0449.05037OpenAlexW2091079949MaRDI QIDQ1147159
Publication date: 1981
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0095-8956(81)90030-7
Related Items (40)
Superposition and constructions of graphs without nowhere-zero \(k\)-flows ⋮ 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 ⋮ Unnamed Item ⋮ 3- and 4-critical graphs of small even order ⋮ Tutte's edge-colouring conjecture ⋮ The Fan–Raspaud conjecture: A randomized algorithmic approach and application to the pair assignment problem in cubic networks ⋮ The circular chromatic index of some Class 2 graphs ⋮ Even cycles and even 2-factors in the line graph of a simple graph ⋮ Unnamed Item ⋮ Petersen Cores and the Oddness of Cubic Graphs ⋮ Roman domination and independent Roman domination on graphs with maximum degree three ⋮ On total coloring and equitable total coloring of infinite snark families ⋮ Rotationally symmetric snarks from voltage graphs ⋮ Edge reductions in cyclically \(k\)-connected cubic graphs ⋮ Snarks of order 18 ⋮ Snarks and flow-snarks constructed from coloring-snarks. ⋮ The hunting of a snark with total chromatic number 5 ⋮ Fulkerson's conjecture and Loupekine snarks ⋮ \(\lambda\)-numbers of several classes of snarks ⋮ Measures of edge-uncolorability of cubic graphs ⋮ The circular chromatic index of Goldberg snarks ⋮ AVD-total-chromatic number of some families of graphs with \(\Delta(G) = 3\) ⋮ Unnamed Item ⋮ The total-chromatic number of some families of snarks ⋮ 6-decomposition of snarks ⋮ Some results on the structure of multipoles in the study of snarks ⋮ Irreducible snarks of given order and cyclic connectivity ⋮ Berge-Fulkerson coloring for some families of superposition snarks ⋮ A Möbius-type gluing technique for obtaining edge-critical graphs ⋮ New results on chromatic index critical graphs ⋮ A note on Berge-Fulkerson coloring ⋮ Computational results and new bounds for the circular flow number of snarks ⋮ The chromatic index of graphs with large maximum degree ⋮ Classification and characterizations of snarks ⋮ Chromatic-index-critical graphs of orders 13 and 14 ⋮ A brief history of edge-colorings – with personal reminiscences ⋮ Decompositions of Snarks into Repeated Dot-Products ⋮ Morphology of small snarks
Cites Work
- On critical graphs with chromatic index 4
- Some remarks on the chromatic index of a graph
- On the edge-chromatic number of a graph
- Infinite Families of Nontrivial Trivalent Graphs Which are Not Tait Colorable
- Polyhedral decompositions of cubic graphs
- Network-Colourings
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Construction of class two graphs with maximum vertex degree three
