Pages that link to "Item:Q855855"
From MaRDI portal
The following pages link to Some generalizations of theorems on vertex coloring (Q855855):
Displaying 5 items.
- On a generalization of the Gallai-Roy-Vitaver theorem to the bandwidth coloring problem (Q943796) (← links)
- The vertex coloring problem and its generalizations (Q1022440) (← links)
- On the connection between the chromatic number of a graph and the number of cycles covering a vertex or an edge (Q1661493) (← links)
- An Erdős-Gallai type theorem for vertex colored graphs (Q2000563) (← links)
- Revisiting a theorem by Folkman on graph colouring (Q2309226) (← links)