The following pages link to (Q4255999):
Displaying 6 items.
- On minimal triangle-free graphs with prescribed \(k\)-defective chromatic number (Q539861) (← links)
- A note on \(n\)-edge chromatic number (Q1387427) (← links)
- Extremal graphs in some coloring problems (Q1584287) (← links)
- On monochromatic component size for improper colourings (Q1775062) (← links)
- Nordhaus-Gaddum-type results for path covering and \(L(2,1)\)-labeling numbers (Q2253966) (← links)
- (Q4294602) (← links)