Bounded size components—partitions and transversals

Penny Haxell, Tibor Szabó, Gábor Tardos

Type: Article

Publication Date: 2003-04-05

Citations: 62

DOI: https://doi.org/10.1016/s0095-8956(03)00031-5

Similar Works

Action	Title	Year	Authors
+	Partitions and decompositions	2003	S. K. Lando
+	Structures of bounded partition width	2003	Achim Blumensath Erich Grädel
+	Partitions and overpartitions with attached parts	2006	Jeremy Lovejoy
+	Shrinkable decompositions	2007	Robert J. Daverman
+	Plane partitions	2004
+	The divisibility and distribution of partitions into distinct parts	2001	Jeremy Lovejoy
+	On partitions into distinct parts ≥ Y	1990	Joachim Herzog
+	Partitioning and the γ-system	1989	Håkan Johansson
+	Multi-rowed partitions with totally distinct parts	1980	Basil Gordon Lorne Houten
+	s-partitions	2002	William M. Y. Goh Paweł Hitczenko Ali Shokoufandeh
+	Partitions of Boxes	2022
+	Enumerating nested and consecutive partitions	1995	F. K. Hwang C. L. Mallows
+	On the kth smallest part of a partition into distinct parts	2024	Rajat Gupta Noah Lebowitz-Lockard Joseph Vandehey
+	Filtrations, Decompositions, and Explosions	1975	Zbigniew Nitecki M. Shub
+	Decompositions	2017	Jack W. Baker David A. Swanson Jeff Tayman Lucky M. Tedrow
+	Classes of Partitions	2017	Victor Kowalenko
+ PDF Chat	On a restricted type of partitions into parts divisible by the least part	1973	S. Kerawala
+	Tame decompositions and collisions	2015	Konstantin Ziegler
+	Finite planes and clique partitions	1990	W. D. Wallis
+	Cut Enumeration	2008	Hiroshi Nagamochi Toshihide Ibaraki

Action	Title	Year	Authors
+	Clustered coloring of graphs with bounded layered treewidth and bounded degree	2023	Chun‐Hung Liu David R. Wood
+ PDF Chat	Defective and clustered choosability of sparse graphs	2019	Kevin Hendrey David R. Wood
+ PDF Chat	Colouring Planar Graphs With Three Colours and No Large Monochromatic Components	2014	Louis Esperet Gwenaël Joret
+	On generalized choice and coloring numbers	2019	Zdeněk Dvořák Jakub Pekárek Jean‐Sébastien Sereni
+ PDF Chat	A Ramsey property of random regular and k‐out graphs	2019	Michael Anastos Deepak Bal
+	Graph Colouring with No Large Monochromatic Components	2008	Nathan Linial Jiřı́ Matoušek Or Sheffet Gábor Tardos
+ PDF Chat	Clustered colouring of graph classes with bounded treedepth or pathwidth	2022	Sergey Norin Alex Scott David R. Wood
+	Graph coloring with no large monochromatic components	2007	Nathan Linial Jiřı́ Matoušek Or Sheffet Gábor Tardos
+	Independent transversals and hypergraph matchings - an elementary approach	2016	Penny Haxell
+ PDF Chat	Isomorphic bisections of cubic graphs	2021	Shagnik Das Alexey Pokrovskiy Benny Sudakov

Action	Title	Year	Authors
+	Independent transversals in r-partite graphs	1997	Raphael Yuster
+ PDF Chat	On linear k-arboricity	1984	J Bermond Jean‐Luc Fouquet Michel Habib Bernard Péroche
+	On the linear k-arboricity of cubic graphs	1996	Bill Jackson Nicholas Wormald
+	Two-Coloring the Edges of a Cubic Graph Such That Each Monochromatic Component Is a Path of Length at Most 5	1999	Carsten Thomassen
+	On complete subgraphs of r-chromatic graphs	1975	B Bollobás Paul Erdős Endre Szemerédi
+	A Note on Vertex List Colouring	2001	Penny Haxell
+	On decomposition of graphs	1967	Péter L. Erdős A. Hajnal
+	Covering and packing in graphs. III: Cyclic and acyclic invariants	1980	Jin Akiyama Geoffrey Exoo Frank Harary
+	More on the linear k-arboricity of regular graphs	1998	R. E. L. Aldred Nicholas Wormald