Graph coloring with no large monochromatic components (Q3503460): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Graph minors. II. Algorithmic aspects of tree-width / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A relaxed Hadwiger's conjecture for list colorings / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Edge-isoperimetric inequalities in the grid / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On the linear \(k\)-arboricity of cubic graphs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Graph minors. XIII: The disjoint paths problem / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Graph minors. X: Obstructions to tree-decomposition / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A Separator Theorem for Planar Graphs / rank | |||
Normal rank | |||
Latest revision as of 17:47, 28 June 2024
scientific article; zbMATH DE number 5348027
- Graph Colouring with No Large Monochromatic Components
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Graph coloring with no large monochromatic components |
scientific article; zbMATH DE number 5348027 |
|
Statements
Graph coloring with no large monochromatic components (English)
0 references
Graph Colouring with No Large Monochromatic Components (English)
0 references
5 June 2008
0 references
29 September 2008
0 references
minor-closed family of graphs
0 references
graph colouringgraph minors
0 references
monochromatic connected subgraphs
0 references
0 references
