Conditional colorings of graphs

2006/06/13 by Hong‐Jian Lai, Hong-Jian Lai, Jianliang Lin +4 · 8 citations
Computer Science · Engineering · #Advanced Graph Theory Research #Graph Labeling and Dimension Problems #graph theory and CDMA systems

paper · doi:10.1016/j.disc.2006.03.052

Cited by

• Improved bounds of r-hued colorings of planar graphs
• Dynamic coloring of graphs having no <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" altimg="si2.gif" display="inline" overflow="scroll"><mml:msub><mml:mrow><mml:mi>K</mml:mi></mml:mrow><mml:mrow><mml:mn>5</mml:mn></mml:mrow></mml:msub></mml:math> minor
• On Dynamic Coloring of Graphs
• Dynamic coloring and list dynamic coloring of planar graphs
• On conditional coloring of some graphs
• Upper bounds of <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="mml1" display="inline" overflow="scroll" altimg="si1.gif"><mml:mi>r</mml:mi></mml:math>-hued colorings of planar graphs
• List <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" overflow="scroll" id="d1e263" altimg="si35.gif"><mml:mi>r</mml:mi></mml:math>-dynamic coloring of graphs with small maximum average degree
• Conditional and Unique Coloring of Graphs (revised resubmission)