scientific article; zbMATH DE number 866664

MaRDI QIDQ4873683zbMATH OpenFDO

Authors Barry A. Tesman

Publication date 17 April 1996

zbMATH Keywords

\(T\)-coloringcomplete graphsfrequency assignment problem\(T\)-spancoloring algorithmsT-set

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Coloring of graphs and hypergraphs (05C15)

Recommendations

• SPN completable graphs
• scientific article; zbMATH DE number 1750663
• Spanning trees of descendants of a complete graph
• scientific article; zbMATH DE number 4142059
• Edge-disjoint spanners of complete graphs and complete digraphs
• scientific article; zbMATH DE number 2174608
• \(T\)-colorings and \(T\)-edge spans of graphs
• Spanners of Complete k-Partite Geometric Graphs
• Spanners of Complete k-Partite Geometric Graphs
• Complete decomposable graphs

Cited in

(3)

• Greedy \(T\)-colorings of graphs
• Distinct total \(T\)-colorings of graphs
• scientific article; zbMATH DE number 841613 (Why is no real title available?)

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