Partitioning complete bipartite graphs by monochromatic cycles
From MaRDI portal
Publication:1354726
DOI10.1006/jctb.1997.1737zbMath0867.05022OpenAlexW1981338295MaRDI QIDQ1354726
Publication date: 3 August 1997
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1006/jctb.1997.1737
Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Coloring of graphs and hypergraphs (05C15) Eulerian and Hamiltonian graphs (05C45)
Related Items (34)
Vertex covers by monochromatic pieces -- a survey of results and problems ⋮ Monochromatic cycle power partitions ⋮ On the diameter of separated point sets with many nearly equal distances ⋮ Partitioning 3-edge-coloured complete bipartite graphs into monochromatic cycles ⋮ Partitioning two-coloured complete multipartite graphs into monochromatic paths and cycles ⋮ An improved bound for the monochromatic cycle partition number ⋮ Vertex covering with monochromatic pieces of few colours ⋮ Bounds for graph regularity and removal lemmas ⋮ Improved monochromatic loose cycle partitions in hypergraphs ⋮ Ore- and Pósa-type conditions for partitioning 2-edge-coloured graphs into monochromatic cycles ⋮ Partitioning edge-coloured complete graphs into monochromatic cycles and paths ⋮ Heterochromatic tree partition problem in complete tripartite graphs ⋮ Vertex partitions of non-complete graphs into connected monochromatic \(k\)-regular graphs ⋮ Local colourings and monochromatic partitions in complete bipartite graphs ⋮ Minimum degree conditions for monochromatic cycle partitioning ⋮ Embedding Graphs into Larger Graphs: Results, Methods, and Problems ⋮ Heterochromatic tree partition numbers for complete bipartite graphs ⋮ Vertex partitions of \(r\)-edge-colored graphs ⋮ On the minimum monochromatic or multicolored subgraph partition problems ⋮ Monochromatic bounded degree subgraph partitions ⋮ The complexity for partitioning graphs by monochromatic trees, cycles and paths ⋮ Heterochromatic tree partition number in complete multipartite graphs ⋮ Partitioning 2-edge-colored complete multipartite graphs into monochromatic cycles, paths and trees ⋮ Partitioning complete graphs by heterochromatic trees ⋮ An Improved Bound for Vertex Partitions by Connected Monochromatic K-Regular Graphs ⋮ Partitioning a graph into a cycle and an anticycle, a proof of Lehel's conjecture ⋮ A note on the Size-Ramsey number of long subdivisions of graphs ⋮ Monochromatic cycle partitions of edge-colored graphs ⋮ Local colourings and monochromatic partitions in complete bipartite graphs ⋮ Monochromatic and heterochromatic subgraphs in edge-colored graphs - A survey ⋮ Monochromatic square-cycle and square-path partitions ⋮ Vertex partitions by connected monochromatic \(k\)-regular graphs ⋮ Monochromatic cycle partitions in random graphs ⋮ Almost Partitioning a 3-Edge-Colored $K_{n,n}$ into Five Monochromatic Cycles
Cites Work
This page was built for publication: Partitioning complete bipartite graphs by monochromatic cycles
