Orientations and 3-colourings of graphs.

MaRDI QIDQ5488201zbMATH OpenFDO

Authors Vincent Chouinard-Prévost, Alexandre Côté, Claude Tardif

Publication date 13 September 2006

Full work available at URL https://eudml.org/doc/126583, http://www.emis.de/journals/CMUC/cmuc0403/cmuc0403.htm

IPFS File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

zbMATH Keywords

graph colouringHasse-Gallai-Roy theorem

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Coloring of graphs and hypergraphs (05C15)

Recommendations

• Oriented colourings of graphs with maximum degree three and four
• Colourings of oriented connected cubic graphs
• Polynomial graph-colorings
• Finding paths between 3-colourings
• Finding paths between 3-colorings

Cited in

(3)

• A quick way to verify if a graph is 3-colorable
• Path homomorphisms, graph colorings, and Boolean matrices
• Oriented colourings of graphs with maximum degree three and four

This page was built for publication: Orientations and 3-colourings of graphs.

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