scientific article; zbMATH DE number 227553

zbMATH Open0774.05037MaRDI QIDQ5286940FDOQ5286940

M. Cozzens, Fred Roberts

Publication date: 7 November 1993

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

Recommendations

• Greedy \(T\)-colorings of graphs
• scientific article; zbMATH DE number 4134072
• Further Results on T-Coloring and Frequency Assignment Problems
• Publication:4863459

zbMATH Keywords

greedy algorithmgraph coloringcomplete graphoptimal \(T\)-coloring

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Coloring of graphs and hypergraphs (05C15)

Cited In (11)

• A rainbow about \(T\)-colorings for complete graphs
• \(T\)-colorings of graphs: recent results and open problems
• No-hole 2-distant colorings for Cayley graphs on finitely generated abelian groups
• \(T\)-graphs and the channel assignment problem
• Meaningfulness of conclusions from combinatorial optimization
• Distance graphs and the \(T\)-coloring problem
• Title not available (Why is that?)
• The complexity of the \(T\)-coloring problem for graphs with small degree
• Distance graphs and \(T\)-coloring
• A rainbow about T-colorings for complete graphs
• Effects of change of scale on optimality in a scheduling model with priorities and earliness/tardiness penalties

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 Q5286940)