scientific article; zbMATH DE number 3813668

MaRDI QIDQ3661614zbMATH OpenFDO

Authors Richard A. Duke, P. Erdős

Publication date 1982

zbMATH Keywords

girthcomplete k-partite sub-k-graphseparating edge

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Paths and cycles (05C38) Hypergraphs (05C65)

Recommendations

• Partitioning complete bipartite graphs by monochromatic cycles
• Monochromatic cycle partitions of \(2\)-coloured graphs with minimum degree \(3n/4\)
• Partitioning Two-Coloured Complete Graphs into Two Monochromatic Cycles
• Alternating cycles in edge-colored graphs
• Vertex-disjoint cycles containing specified vertices in a bipartite graph
• Edge condition for long cycles in bipartite graphs
• DECOMPOSITIONS OF COMPLETE MULTIPARTITE GRAPHS INTO GREGARIOUS 6-CYCLES USING COMPLETE DIFFERENCES
• scientific article; zbMATH DE number 3505018

Cited in

(4)

• Cycle-connected graphs
• On a problem of Duke-Erdős-Rödl on cycle-connected subgraphs
• On \(k\)-partite subgraphs
• scientific article; zbMATH DE number 3891408 (Why is no real title available?)

This page was built for publication:

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