Greedy T-colorings of graphs
From MaRDI portal
Publication:1024485
DOI10.1016/J.DISC.2008.01.049zbMATH Open1213.05089OpenAlexW2041534430MaRDI QIDQ1024485FDOQ1024485
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
Recommendations
Cites Work
- \(T\)-colorings of graphs: recent results and open problems
- Title not available (Why is that?)
- Frequency planning and ramifications of coloring
- A rainbow about \(T\)-colorings for complete graphs
- A polynomial algorithm for finding \(T\)-span of generalized cacti
- \(T\)-graphs and the channel assignment problem
- The complexity of the \(T\)-coloring problem for graphs with small degree
Cited In (7)
- \(T\)-colorings, divisibility and the circular chromatic number
- Greedy \(F\)-colorings of graphs
- Greedy algorithms for eigenvalue optimization problems in shape design of two-density inhomogeneous materials
- \(T_r\)-span of directed wheel graphs
- Title not available (Why is that?)
- Two algorithms for a class of elliptic problems in shape optimization
- Title not available (Why is that?)
This page was built for publication: Greedy \(T\)-colorings of graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1024485)