Monochromatic homeomorphically irreducible trees in 2-edge-colored complete graphs

DOI10.4310/JOC.2018.V9.N4.A6zbMATH Open1401.05112OpenAlexW2903643793MaRDI QIDQ1630697FDOQ1630697

Authors: Michitaka Furuya, Shoichi Tsuchiya 

Publication date: 10 December 2018

Published in: Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.4310/joc.2018.v9.n4.a6

Recommendations

• Highly connected monochromatic subgraphs
• Highly connected monochromatic subgraphs of two-colored complete graphs
• Size of monochromatic double stars in edge colorings
• Monochromatic connectivity in monochromatic-star-free graphs
• Partitioning complete multipartite graphs by monochromatic trees

zbMATH Keywords

homeomorphically irreducible spanning tree2-edge-colored complete graph

Mathematics Subject Classification ID

Eulerian and Hamiltonian graphs (05C45) Coloring of graphs and hypergraphs (05C15) Paths and cycles (05C38)

Cited In (3)

• Special monochromatic trees in two-colored complete graphs
• Monochromatic spanning trees and matchings in ordered complete graphs
• On monochromatic subgraphs of edge-colored complete graphs

This page was built for publication: Monochromatic homeomorphically irreducible trees in 2-edge-colored complete graphs

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