Colourfully panconnected subgraphs. II.

MaRDI QIDQ2846652zbMATH OpenFDO

Authors Douglas R. Woodall

Publication date 9 September 2013

Published in Ars Combinatoria (Search for Journal in Brave)

zbMATH Keywords

distance-\(k\)-connectedpanconnected colouringspanning treevariegated colouring

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 1146221
• Highly connected monochromatic subgraphs of two-colored complete graphs
• scientific article; zbMATH DE number 3851127
• Highly connected monochromatic subgraphs
• Forbidden rainbow subgraphs that force large highly connected monochromatic subgraphs

Cited in

(2)

• scientific article; zbMATH DE number 3851127 (Why is no real title available?)
• scientific article; zbMATH DE number 1146221 (Why is no real title available?)

This page was built for publication: Colourfully panconnected subgraphs. II.

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