scientific article; zbMATH DE number 2170455

MaRDI QIDQ4677950zbMATH OpenFDO

Authors Klas Markström

Publication date 23 May 2005

zbMATH Keywords

conjecture of Erdős and Gyárfáscubic graphs

Mathematics Subject Classification ID

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

Recommendations

• On the number of cycles in a graph
• scientific article; zbMATH DE number 109192
• scientific article; zbMATH DE number 4010555
• An extremal problem for cycles in hamiltonian graphs
• Extremal problems for cycles in graphs

Cited in

(23)

• Computer observations of cycles in cubic graphs
• Extremal graphs with prescribed circumference and cocircumference
• Erdős-Gyárfás conjecture for some families of Cayley graphs
• Extremal problems on components and loops in graphs
• Bicyclic graphs with extremal cover cost
• Cycle-regular graphs
• On the Erdős-Gyárfás conjecture in claw-free graphs
• Extremal problems for cycles in graphs
• scientific article; zbMATH DE number 4010555 (Why is no real title available?)
• scientific article; zbMATH DE number 109192 (Why is no real title available?)
• On stable cycles and cycle double covers of graphs with large circumference
• A note on extremal results on directed acyclic graphs
• Generation and properties of snarks
• A Möbius-invariant power diagram and its applications to soap bubbles and planar Lombardi drawing
• On the extremal cactus graphs for variable sum exdeg index with a fixed number of cycles
• On the Erdős-Gyárfás conjecture for some Cayley graphs
• On \(q\)-power cycles in cubic graphs
• On 2-power unicyclic cubic graphs
• The Extremal Number of Tight Cycles
• On absorbing cycles in min-max digraphs
• scientific article; zbMATH DE number 969988 (Why is no real title available?)
• The Erdős-Gsyárfás conjecture holds for \(P_{10}\)-free graphs
• Triangle-free graphs with the maximum number of cycles

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