Pages that link to "Item:Q2997600"
From MaRDI portal
The following pages link to 3-consecutive C-colorings of graphs (Q2997600):
Displaying 16 items.
- Neighborhood-restricted \([\leq 2]\)-achromatic colorings (Q290097) (← links)
- Vertex colorings without rainbow subgraphs (Q339490) (← links)
- Maximum number of colors: C-coloring and related problems (Q408951) (← links)
- Vertex coloring without large polychromatic stars (Q432703) (← links)
- WORM colorings of planar graphs (Q521753) (← links)
- 3-consecutive edge coloring of a graph (Q658096) (← links)
- \(K_3\)-WORM colorings of graphs: lower chromatic number and gaps in the chromatic spectrum (Q726653) (← links)
- Improved bounds for some facially constrained colorings (Q2107748) (← links)
- \(F\)-WORM colorings: results for 2-connected graphs (Q2403800) (← links)
- Coloring subgraphs with restricted amounts of hues (Q2406596) (← links)
- Worm colorings (Q2516682) (← links)
- When the vertex coloring of a graph is an edge coloring of its line graph -- a rare coincidence. (Q2829074) (← links)
- (Q3487434) (← links)
- 3-Sequent achromatic sum of graphs (Q5013492) (← links)
- (Q5074602) (← links)
- ℱ-WORM colorings of some 2-trees: partition vectors (Q5225032) (← links)