Pages that link to "Item:Q579272"
From MaRDI portal
The following pages link to On a theorem about vertex colorings of graphs (Q579272):
Displaying 12 items.
- Satisfactory graph partition, variants, and generalizations (Q976309) (← links)
- The vertex coloring problem and its generalizations (Q1022440) (← links)
- Partitioning a graph into alliance free sets (Q1025928) (← links)
- A structural theorem on embedded graphs and its application to colorings (Q1034219) (← links)
- Judicious partitions of graphs (Q1314903) (← links)
- An Erdős-Gallai type theorem for vertex colored graphs (Q2000563) (← links)
- Revisiting a theorem by Folkman on graph colouring (Q2309226) (← links)
- A map colour theorem for the union of graphs (Q2581497) (← links)
- (Q4534477) (← links)
- Problems and results on judicious partitions (Q4798176) (← links)
- (Q5487911) (← links)
- Majority choosability of countable graphs (Q6181996) (← links)