Graph coloring with no large monochromatic components (Q3503460): Difference between revisions

From MaRDI portal
Merged Item from Q3527544
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Partitioning into graphs with only small components / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Separator Theorem for Nonplanar Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Game of Hex and the Brouwer Fixed-Point Theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounded size components -- partitions and transversals. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Expander graphs and their applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4857375 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Low diameter graph decompositions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Large Monochromatic Components in Two-colored Grids / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two-coloring the edges of a cubic graph such that each monochromatic component is a path of length at most 5 / rank
 
Normal rank

Revision as of 11:21, 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
  • Graph Colouring with No Large Monochromatic Components

Statements

Graph coloring with no large monochromatic components (English)
0 references
Graph Colouring with No Large Monochromatic Components (English)
0 references
0 references
0 references
0 references
0 references
0 references
0 references
5 June 2008
0 references
29 September 2008
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
minor-closed family of graphs
0 references
graph colouringgraph minors
0 references
monochromatic connected subgraphs
0 references
0 references
0 references