scientific article; zbMATH DE number 867661

zbMATH Open0841.05033MaRDI QIDQ4873773FDOQ4873773

Authors: Fred Roberts 

Publication date: 22 April 1996

Title of this publication is not available (Why is that?)

Recommendations

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

zbMATH Keywords

graph coloringlist colorings\(T\)-colorings

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Cited In (19)

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

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)