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

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(9 intermediate revisions by 7 users not shown)
aliases / en / 0aliases / en / 0
 
Graph Colouring with No Large Monochromatic Components
description / endescription / en
scientific article
scientific article; zbMATH DE number 5348027
Property / author
 
Property / author: Ji{ří} Matoušek / rank
Normal rank
 
Property / title
 
Graph Colouring with No Large Monochromatic Components (English)
Property / title: Graph Colouring with No Large Monochromatic Components (English) / rank
 
Normal rank
Property / zbMATH Open document ID
 
Property / zbMATH Open document ID: 1171.05021 / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1017/S0963548308009140 / rank
 
Normal rank
Property / author
 
Property / author: Ji{ří} Matoušek / rank
 
Normal rank
Property / published in
 
Property / published in: Combinatorics, Probability and Computing / rank
 
Normal rank
Property / publication date
 
29 September 2008
Timestamp+2008-09-29T00:00:00Z
Timezone+00:00
CalendarGregorian
Precision1 day
Before0
After0
Property / publication date: 29 September 2008 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 05C83 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 05C55 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 5348027 / rank
 
Normal rank
Property / zbMATH Keywords
 
graph colouringgraph minors
Property / zbMATH Keywords: graph colouringgraph minors / rank
 
Normal rank
Property / zbMATH Keywords
 
monochromatic connected subgraphs
Property / zbMATH Keywords: monochromatic connected subgraphs / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2066530434 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: math/0703362 / rank
 
Normal rank
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
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
links / mardi / namelinks / mardi / name
 

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
  • 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