scientific article; zbMATH DE number 867661

zbMath0841.05033MaRDI QIDQ4873773

Fred S. Roberts

Publication date: 22 April 1996

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

graph coloring\(T\)-coloringslist colorings

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items (18)

Chromatic scheduling and frequency assignment ⋮ The channel assignment problem for mutually adjacent sites ⋮ Relating path coverings to vertex labellings with a condition at distance two ⋮ Chromatic invariants for finite graphs: Theme and polynomial variations ⋮ Computational complexity of distance edge labeling ⋮ Threshold-coloring and unit-cube contact representation of planar graphs ⋮ A rainbow about \(T\)-colorings for complete graphs ⋮ Degree‐bounded coloring of graphs: Variations on a theme by brooks ⋮ A rainbow about T-colorings for complete graphs ⋮ \(T\)-colorings of graphs: recent results and open problems ⋮ \(L(1,1)\)-labelling of the direct product of a complete graph and a cycle ⋮ No-hole \((r+1)\)-distant colorings ⋮ On labeling the vertices of products of complete graphs with distance constraints ⋮ Unnamed Item ⋮ Minimum partition of an independence system into independent sets ⋮ Complexity of choosing subsets from color sets ⋮ Sinks in acyclic orientations of graphs ⋮ No-hole 2-distant colorings

This page was built for publication: