Forbidden Rainbow Subgraphs That Force Large Highly Connected Monochromatic Subgraphs

DOI10.1137/120896906zbMath1310.05091OpenAlexW2152158512MaRDI QIDQ2870527

Shinya Fujita, Colton Magnant

Publication date: 21 January 2014

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

Full work available at URL: https://doi.org/10.1137/120896906

zbMATH Keywords

rainbow subgraphGallai coloringhighly connected monochromatic subgraph

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Connectivity (05C40)

Related Items

Forbidden properly edge-colored subgraphs that force large highly connected monochromatic subgraphs ⋮ Forbidden rainbow subgraphs that force large monochromatic or multicolored \(k\)-connected subgraphs