scientific article; zbMATH DE number 147631

MaRDI QIDQ4030535zbMATH OpenFDO

Authors Guifang Wang, Lianzhu Zhang

Publication date 1 April 1993

zbMATH Keywords

edge disjoint cyclesextremal graphsfeasible subdivision

Mathematics Subject Classification ID

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

Recommendations

• On independent cycles and edges in graphs
• Edge maximal C_{2k+1}-edge disjoint free graphs
• scientific article; zbMATH DE number 5943492
• scientific article; zbMATH DE number 7144824
• Packing edge-disjoint cycles in graphs and the cyclomatic number

Cited in

(10)

• The maximal size of graphs with at most \(k\) edge-disjoint paths connecting any two adjacent vertices
• An extremal problem concerning graphs not containing \(K_t\) and \(K_{t,n-t}\)
• On independent cycles and edges in graphs
• Random unlabelled graphs containing few disjoint cycles
• scientific article; zbMATH DE number 4033781 (Why is no real title available?)
• Extremal Graphs without Large Forbidden Subgraphs
• scientific article; zbMATH DE number 1416474 (Why is no real title available?)
• scientific article; zbMATH DE number 7144824 (Why is no real title available?)
• Extremal problems on planar graphs without k edge-disjoint cycles
• Packing edge-disjoint cycles in graphs and the cyclomatic number

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 Q4030535)