Pages that link to "Item:Q1400964"
From MaRDI portal
The following pages link to Bounded size components -- partitions and transversals. (Q1400964):
Displaying 30 items.
- Colorful strips (Q659707) (← links)
- Extremal problems for transversals in graphs with bounded degree (Q855115) (← links)
- Relaxed two-coloring of cubic graphs (Q885301) (← 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)
- 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)
- Clustered variants of Hajós' conjecture (Q2664549) (← links)
- Bounded transversals in multipartite graphs (Q2897209) (← 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)
- Acyclic systems of representatives and acyclic colorings of digraphs (Q3605147) (← links)
- Transversals of Vertex Partitions in Graphs (Q4712708) (← 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)
- Strong coloring 2‐regular graphs: Cycle restrictions and partial colorings (Q6081880) (← links)
- Constructing graphs with no independent transversals (Q6574378) (← links)
- Clustered coloring of graphs with bounded layered treewidth and bounded degree (Q6612290) (← links)
