Relaxed coloring of a graph
From MaRDI portal
Publication:1393026
DOI10.1007/s003730050020zbMath0917.05027OpenAlexW2043085939MaRDI QIDQ1393026
Publication date: 18 July 1999
Published in: Graphs and Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s003730050020
Related Items
A QUESTION ON RELAXED EQUITABLE COLORING ⋮ The relaxed game chromatic index of \(k\)-degenerate graphs ⋮ The relaxed edge-coloring game and \(k\)-degenerate graphs ⋮ A note on relaxed equitable coloring of graphs ⋮ A simple competitive graph coloring algorithm. II. ⋮ On monochromatic component size for improper colourings ⋮ Relaxed equitable colorings of planar graphs with girth at least 8 ⋮ On (s,t)-relaxed L(1,1)-labelling of trees
This page was built for publication: Relaxed coloring of a graph