Special monochromatic trees in two-colored complete graphs

DOI10.1002/(SICI)1097-0118(199701)24:1%3C59::AID-JGT7%3E3.0.CO;2-IzbMATH Open0866.05044OpenAlexW2029816373MaRDI QIDQ5284596FDOQ5284596

Guantao Chen, Ľubomír Šoltés, R. H. Schelp

Publication date: 27 July 1997

Full work available at URL: https://doi.org/10.1002/(sici)1097-0118(199701)24:1%3C59::aid-jgt7%3E3.0.co;2-i

Recommendations

• Monochromatic homeomorphically irreducible trees in 2-edge-colored complete graphs
• Multicolored trees in complete graphs
• Multicolored trees in complete graphs
• Monochromatic trees with respect to edge partitions
• Monochromatic trees in random graphs
• Monochromatic trees in random graphs
• Monochromatic cycles in 2-coloured graphs
• Monochromatic tree partition for complete multipartite graphs
• Monochromatic tree covers and Ramsey numbers for set-coloured graphs
• Highly connected monochromatic subgraphs of two-colored complete graphs

zbMATH Keywords

tree\(k\)-cluster

Mathematics Subject Classification ID

Trees (05C05) Generalized Ramsey theory (05C55)

This page was built for publication: Special monochromatic trees in two-colored complete graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5284596)