Pages that link to "Item:Q1229220"
From MaRDI portal
The following pages link to Brooks' graph-coloring theorem and the independence number (Q1229220):
Displaying 14 items.
- On the maximum parsimony distance between phylogenetic trees (Q259724) (← links)
- A unified proof of Brooks' theorem and Catlin's theorem (Q472980) (← links)
- Chromatic optimisation: Limitations, objectives, uses, references (Q1162931) (← links)
- The edge chromatic difference sequence of a cubic graph (Q1377864) (← links)
- Vertex arboricity and maximum degree (Q1894756) (← links)
- The toughness of cubic graphs (Q1911237) (← links)
- LDPC codes constructed from cubic symmetric graphs (Q2081552) (← links)
- A Catlin-type theorem for graph partitioning avoiding prescribed subgraphs (Q2142650) (← links)
- Well-hued graphs (Q2166254) (← links)
- Brooks' Theorem and Beyond (Q3466339) (← links)
- Vertex partition of hypergraphs and maximum degenerate subhypergraphs (Q4958039) (← links)
- Recognizing Graphs Close to Bipartite Graphs (Q5111287) (← links)
- Recognizing graphs close to bipartite graphs with an application to colouring reconfiguration (Q6056774) (← links)
- Partitioning of a graph into induced subgraphs not containing prescribed cliques (Q6180565) (← links)