Network-Colourings

DOI10.2307/3610702zbMATH Open0030.37601OpenAlexW4233249038MaRDI QIDQ5786873FDOQ5786873

Authors: 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

Recommendations

• Regular \(n\)-valent \(n\)-connected non-Hamiltonian non \(n\)-edge-colourable graphs
• scientific article; zbMATH DE number 3974976
• Regular colorings in regular graphs
• On the existence of graphs which can colour every regular graph
• scientific article; zbMATH DE number 2362599

zbMATH Keywords

graph coloring

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Cited In (16)

• Color-character of uncolorable cubic graphs
• Morphology of small snarks
• Superposition of snarks revisited
• Irreducible snarks of given order and cyclic connectivity
• Colouring problems
• Normal 5-edge-coloring of some snarks superpositioned by flower snarks
• Even cycles and even 2-factors in the line graph of a simple graph
• Classification and characterizations of snarks
• Construction of class two graphs with maximum vertex degree three
• Measures of edge-uncolorability of cubic graphs
• Rotationally symmetric snarks from voltage graphs
• The hunting of a snark with total chromatic number 5
• Title not available (Why is that?)
• Smallest snarks with oddness 4 and cyclic connectivity 4 have order 44
• The hardness of recognising poorly matchable graphs and the hunting of the \(d\)-snark
• Graphs with valency k, edge connectivity k, chromatic index k+1 and arbitrary girth

This page was built for publication: Network-Colourings

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5786873)