Network-Colourings

DOI10.2307/3610702zbMath0030.37601OpenAlexW4233249038MaRDI QIDQ5786873

Blanche Descartes

Publication date: 1948

Published in: The Mathematical Gazette (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2307/3610702

zbMATH Keywords

graph coloring

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items (14)

Unnamed Item ⋮ Even cycles and even 2-factors in the line graph of a simple graph ⋮ Construction of class two graphs with maximum vertex degree three ⋮ Rotationally symmetric snarks from voltage graphs ⋮ The hunting of a snark with total chromatic number 5 ⋮ Superposition of snarks revisited ⋮ Measures of edge-uncolorability of cubic graphs ⋮ Irreducible snarks of given order and cyclic connectivity ⋮ Colouring problems ⋮ Smallest snarks with oddness 4 and cyclic connectivity 4 have order 44 ⋮ Color-character of uncolorable cubic graphs ⋮ Graphs with valency k, edge connectivity k, chromatic index k+1 and arbitrary girth ⋮ Classification and characterizations of snarks ⋮ Morphology of small snarks

This page was built for publication: Network-Colourings