On nice graphs

DOI10.1016/S0012-365X(00)00190-4zbMath0990.05058MaRDI QIDQ5936050

Pavol Hell, Andre Raspaud, Eric Sopena, Alexandr V. Kostochka

Publication date: 8 August 2002

Published in: Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

characterizationschromatic numberoriented graphsedge-coloured graphsgraph homomorphismsnice graphsuniversal graphs

Mathematics Subject Classification ID

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

Related Items (9)

The complexity of signed graph and edge-coloured graph homomorphisms ⋮ On fractional version of oriented coloring ⋮ On nice and injective-nice tournaments ⋮ \(L(2,1)\)-labelings of some families of oriented planar graphs ⋮ Homomorphisms from sparse graphs with large girth. ⋮ Unnamed Item ⋮ Complexity of planar signed graph homomorphisms to cycles ⋮ Chromatic number of sparse colored mixed planar graphs ⋮ Nilpotent families of endomorphisms of \((\mathcal P(V)^+,\cup)\)

This page was built for publication: On nice graphs