Bounded transversals in multipartite graphs
- 14 June 2011
- journal article
- Published by Wiley in Journal of Graph Theory
- Vol. 70 (3) , 318-331
Abstract
No abstract availableKeywords
This publication has 13 references indexed in Scilit:
- Relaxed two-coloring of cubic graphsJournal of Combinatorial Theory, Series B, 2007
- Density Conditions For Triangles In Multipartite GraphsCombinatorica, 2006
- Odd Independent Transversals are OddCombinatorics, Probability and Computing, 2006
- Bounded size components—partitions and transversalsJournal of Combinatorial Theory, Series B, 2003
- A Note on Vertex List ColouringCombinatorics, Probability and Computing, 2001
- The number of complete subgraphs of equi-partite graphsDiscrete Mathematics, 1998
- Complete Subgraphs of r-partite GraphsCombinatorics, Probability and Computing, 1992
- The strong chromatic number of a graphRandom Structures & Algorithms, 1992
- The linear arboricity of graphsIsrael Journal of Mathematics, 1988
- On complete subgraphs of r-chromatic graphsDiscrete Mathematics, 1975