Forbidden properly edge-colored subgraphs that force large highly connected monochromatic subgraphs

DOI10.1007/S00373-017-1804-5MaRDI QIDQ2409532zbMATH OpenOpenAlexFDO

Authors Robert Katić, Colton Magnant, Pouria Salehi Nowbandegani

Publication date 11 October 2017

Published in Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s00373-017-1804-5

zbMATH Keywords

6-cycleedge-coloringforbidden subgraphmonochromatic connectivity

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Connectivity (05C40) Structural characterization of families of graphs (05C75)

Recommendations

• Forbidden rainbow subgraphs that force large highly connected monochromatic subgraphs
• Monochromatic components in edge-coloured graphs with large minimum degree
• Forbidden rainbow subgraphs that force large monochromatic or multicolored \(k\)-connected subgraphs
• Highly connected monochromatic subgraphs
• Highly connected monochromatic subgraphs of two-colored complete graphs

Cites work

• Forbidden rainbow subgraphs that force large highly connected monochromatic subgraphs
• Highly connected monochromatic subgraphs
• Highly connected monochromatic subgraphs of multicolored graphs
• Note on highly connected monochromatic subgraphs in 2-colored complete graphs

Cited in

(1)

• Forbidden rainbow subgraphs that force large monochromatic or multicolored \(k\)-connected subgraphs

This page was built for publication: Forbidden properly edge-colored subgraphs that force large highly connected monochromatic subgraphs

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