scientific article; zbMATH DE number 227553

zbMath0774.05037MaRDI QIDQ5286940

Margaret B. Cozzens, Fred S. Roberts

Publication date: 7 November 1993

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

greedy algorithmgraph coloringcomplete graphoptimal \(T\)-coloring

Mathematics Subject Classification ID

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

Related Items (9)

\(T\)-graphs and the channel assignment problem ⋮ Effects of change of scale on optimality in a scheduling model with priorities and earliness/tardiness penalties ⋮ A rainbow about \(T\)-colorings for complete graphs ⋮ No-hole 2-distant colorings for Cayley graphs on finitely generated abelian groups ⋮ A rainbow about T-colorings for complete graphs ⋮ The complexity of the \(T\)-coloring problem for graphs with small degree ⋮ \(T\)-colorings of graphs: recent results and open problems ⋮ Distance graphs and the \(T\)-coloring problem ⋮ Distance graphs and \(T\)-coloring

This page was built for publication: