Greedy \(T\)-colorings of graphs

DOI10.1016/j.disc.2008.01.049zbMath1213.05089OpenAlexW2041534430MaRDI QIDQ1024485

Robert Janczewski

Publication date: 17 June 2009

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2008.01.049

zbMATH Keywords

greedy algorithm\(T\)-coloring\(T\)-span

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items (4)

\(T_r\)-span of directed wheel graphs ⋮ Two algorithms for a class of elliptic problems in shape optimization ⋮ \(T\)-colorings, divisibility and the circular chromatic number ⋮ Greedy algorithms for eigenvalue optimization problems in shape design of two-density inhomogeneous materials

Cites Work

• Unnamed Item
• \(T\)-colorings of graphs: recent results and open problems
• \(T\)-graphs and the channel assignment problem
• The complexity of the \(T\)-coloring problem for graphs with small degree
• A polynomial algorithm for finding \(T\)-span of generalized cacti
• A rainbow about \(T\)-colorings for complete graphs
• Frequency planning and ramifications of coloring

This page was built for publication: Greedy \(T\)-colorings of graphs