scientific article; zbMATH DE number 867661

MaRDI QIDQ4873773zbMATH OpenFDO

Authors Fred Roberts

Publication date 22 April 1996

zbMATH Keywords

\(T\)-coloringsgraph coloringlist colorings

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Recommendations

• scientific article; zbMATH DE number 1302184
• Graph coloring problems
• On the use of some known methods for \(T\)-colorings of graphs
• Graph Colorings

Cited in

(20)

• Minimum partition of an independence system into independent sets
• \(T\)-colorings of graphs: recent results and open problems
• No-hole 2-distant colorings
• 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
• Complexity of choosing subsets from color sets
• Sinks in acyclic orientations of graphs
• Chromatic invariants for finite graphs: Theme and polynomial variations
• A rainbow about T-colorings for complete graphs
• The method of coloring in graphs and its application
• scientific article; zbMATH DE number 434892 (Why is no real title available?)
• Threshold-coloring and unit-cube contact representation of planar graphs
• On labeling the vertices of products of complete graphs with distance constraints
• Degree‐bounded coloring of graphs: Variations on a theme by brooks
• \(L(1,1)\)-labelling of the direct product of a complete graph and a cycle
• Open neighbourhood colouring of some path related graphs
• A rainbow about T-colorings for complete graphs
• No-hole (r+1)-distant colorings
• L(3, 2, 1)-labeling of the square of cycles

This page was built for publication:

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