Bounded transversals in multipartite graphs
From MaRDI portal
Publication:2897209
DOI10.1002/JGT.20618zbMATH Open1244.05172OpenAlexW2100004673MaRDI QIDQ2897209FDOQ2897209
Authors: Robert Berke, Penny Haxell, Tibor Szabó 
Publication date: 10 July 2012
Published in: Journal of Graph Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/jgt.20618
Recommendations
Cites Work
- The linear arboricity of graphs
- Density conditions for triangles in multipartite graphs
- On complete subgraphs of \(r\)-chromatic graphs
- Title not available (Why is that?)
- Independent transversals in \(r\)-partite graphs
- Complete Subgraphs of r-partite Graphs
- Extremal problems for transversals in graphs with bounded degree
- The strong chromatic number of a graph
- Relaxed two-coloring of cubic graphs
- Bounded size components -- partitions and transversals.
- Odd Independent Transversals are Odd
- A note on vertex list colouring
- The number of complete subgraphs of equi-partite graphs
Cited In (9)
- Title not available (Why is that?)
- Constructing graphs with no independent transversals
- On subgraphs induced by transversals in vertex-partitions of graphs
- Bisection width of transposition graphs
- Bounds on the game transversal number in hypergraphs
- Transversals of longest cycles in chordal and bounded tree-width graphs
- On density conditions for transversal trees in multipartite graphs
- A precise condition for independent transversals in bipartite covers
- Bounds on upper transversals in hypergraphs
This page was built for publication: Bounded transversals in multipartite graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2897209)
