Heterochromatic tree partition numbers for complete bipartite graphs

DOI10.1016/j.disc.2007.07.085zbMath1160.05014OpenAlexW2158661310MaRDI QIDQ932639

He Chen, Jian-hua Tu, Xue Liang Li, Ze-min Jin

Publication date: 11 July 2008

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2007.07.085

zbMATH Keywords

edge-coloringcomplete bipartite graphpartition numberheterochromatic tree

Mathematics Subject Classification ID

Trees (05C05) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Structural characterization of families of graphs (05C75) Coloring of graphs and hypergraphs (05C15)

Related Items (7)

Implicit finite difference method for fractional percolation equation with Dirichlet and fractional boundary conditions ⋮ Heterochromatic tree partition problem in complete tripartite graphs ⋮ Heterochromatic tree partition number in complete multipartite graphs ⋮ An improved meshless method for solving two-dimensional distributed order time-fractional diffusion-wave equation with error estimate ⋮ Partitioning complete graphs by heterochromatic trees ⋮ Monochromatic and heterochromatic subgraphs in edge-colored graphs - A survey ⋮ A numerical technique based on the shifted Legendre polynomials for solving the time-fractional coupled KdV equations

Cites Work

• Partitioning by monochromatic trees
• Vertex coverings by monochromatic cycles and trees
• Split and balanced colorings of complete graphs
• Partitioning complete bipartite graphs by monochromatic cycles
• Monochromatic Paths in Graphs
• Partitioning Two-Coloured Complete Graphs into Two Monochromatic Cycles
• Partitioning complete multipartite graphs by monochromatic trees
• Vertex coverings by monochromatic paths and cycles

This page was built for publication: Heterochromatic tree partition numbers for complete bipartite graphs