Pages that link to "Item:Q1243281"
From MaRDI portal
The following pages link to Covering the vertex set of a graph with subgraphs of smaller degree (Q1243281):
Displayed 13 items.
- Randomly colouring graphs (a combinatorial view) (Q458462) (← links)
- On a theorem about vertex colorings of graphs (Q579272) (← links)
- Graph theory (algorithmic, algebraic, and metric problems) (Q581419) (← links)
- Heuristics for automated knowledge source integration and service composition (Q941554) (← links)
- Satisfactory graph partition, variants, and generalizations (Q976309) (← links)
- Another bound on the chromatic number of a graph (Q1248527) (← links)
- Distributed coloring algorithms for triangle-free graphs (Q2347810) (← links)
- New upper bounds for the chromatic number of a graph (Q2707978) (← links)
- Coloring Sparse Hypergraphs (Q2813339) (← links)
- On Brooks' Theorem for Sparse Graphs (Q4852428) (← links)
- Destroying Noncomplete Regular Components in Graph Partitions (Q4908827) (← links)
- A note on Reed's conjecture for triangle-free graphs (Q6080563) (← links)
- On triangle-free list assignments (Q6184549) (← links)