Pages that link to "Item:Q1405114"
From MaRDI portal
The following pages link to Partitioning into graphs with only small components (Q1405114):
Displaying 50 items.
- From the plane to higher surfaces (Q444375) (← links)
- Partitioning a graph into minimum gap components (Q510915) (← links)
- On the complexity of generalized chromatic polynomials (Q679542) (← links)
- Graph partition into small cliques (Q741755) (← links)
- Relaxed two-coloring of cubic graphs (Q885301) (← links)
- On tree-partition-width (Q1024321) (← links)
- Partitioning graphs of bounded tree-width (Q1307308) (← links)
- Bounded size components -- partitions and transversals. (Q1400964) (← links)
- Partitions of graphs with high minimum degree or connectivity. (Q1405098) (← links)
- Partitioning into graphs with only small components (Q1405114) (← links)
- On generalized choice and coloring numbers (Q1733934) (← links)
- A note on 2-bisections of claw-free cubic graphs (Q1752606) (← links)
- On monochromatic component size for improper colourings (Q1775062) (← links)
- Isomorphic bisections of cubic graphs (Q1984530) (← links)
- Partitioning a graph into degenerate subgraphs (Q2011133) (← links)
- On the \(k\)-component independence number of a tree (Q2045314) (← links)
- Immersion and clustered coloring (Q2099417) (← links)
- Colouring planar graphs with bounded monochromatic components (Q2182229) (← links)
- Partitioning sparse graphs into an independent set and a graph with bounded size components (Q2185923) (← links)
- Degree bipartite Ramsey numbers (Q2233618) (← links)
- Coloring subgraphs with restricted amounts of hues (Q2406596) (← links)
- Information-sharing in social networks (Q2437849) (← links)
- On the minimum monochromatic or multicolored subgraph partition problems (Q2456352) (← links)
- Clustered variants of Hajós' conjecture (Q2664549) (← links)
- Hadwiger’s Conjecture (Q2827298) (← links)
- Degree Ramsey numbers of graphs (Q2883865) (← links)
- On vertex partitions and some minor-monotone graph parameters (Q3067061) (← links)
- A Relative of Hadwiger's Conjecture (Q3461983) (← links)
- Large Monochromatic Components in Two-colored Grids (Q3503446) (← links)
- Graph coloring with no large monochromatic components (Q3503460) (← links)
- Deciding Relaxed Two-Colourability: A Hardness Jump (Q3557504) (← links)
- (Q4503094) (← links)
- Destroying Noncomplete Regular Components in Graph Partitions (Q4908827) (← links)
- Splitting Planar Graphs of Girth 6 into Two Linear Forests with Short Paths (Q4978291) (← links)
- Finding independent transversals efficiently (Q4987260) (← links)
- Defective and clustered choosability of sparse graphs (Q5222556) (← links)
- Colouring Planar Graphs With Three Colours and No Large Monochromatic Components (Q5495675) (← links)
- Some of My Favorite Coloring Problems for Graphs and Digraphs (Q5506778) (← links)
- Islands in Graphs on Surfaces (Q5743553) (← links)
- Clustered colouring of graph classes with bounded treedepth or pathwidth (Q5885188) (← links)
- Clustered 3-colouring graphs of bounded degree (Q5886311) (← links)
- Partitioning \(H\)-minor free graphs into three subgraphs with no large components (Q5890901) (← links)
- Partitioning \(H\)-minor free graphs into three subgraphs with no large components (Q5915769) (← links)
- Path partition of planar graphs with girth at least six (Q6059078) (← links)
- A lower bound on the multicolor size-Ramsey numbers of paths in hypergraphs (Q6568845) (← links)
- Asymptotic dimension of minor-closed families and Assouad-Nagata dimension of surfaces (Q6582315) (← links)
- Clustered coloring of graphs with bounded layered treewidth and bounded degree (Q6612290) (← links)
- Colouring strong products (Q6612523) (← links)
- Tree-partitions with bounded degree trees (Q6630448) (← links)
- Product structure of graph classes with bounded treewidth (Q6632809) (← links)
