scientific article; zbMATH DE number 227553

MaRDI QIDQ5286940zbMATH OpenFDO

Authors M. Cozzens, Fred Roberts

Publication date 7 November 1993

zbMATH Keywords

complete graphgraph coloringgreedy algorithmoptimal \(T\)-coloring

Mathematics Subject Classification ID

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

Recommendations

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

Cited in

(11)

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

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)