Pages that link to "Item:Q1323496"
From MaRDI portal
The following pages link to Relaxed chromatic numbers of graphs (Q1323496):
Displaying 6 items.
- Bounded families for the on-line \(t\)-relaxed coloring (Q1044722) (← links)
- On monochromatic component size for improper colourings (Q1775062) (← links)
- On \(t\)-relaxed 2-distant circular coloring of graphs (Q2045235) (← links)
- Channel assignment problem and relaxed 2-distant coloring of graphs (Q2306601) (← links)
- Deciding Relaxed Two-Colourability: A Hardness Jump (Q3557504) (← links)
- A note on on-line ranking number of graphs (Q3599891) (← links)
