scientific article; zbMATH DE number 426167

zbMATH Open0790.05048MaRDI QIDQ3136994FDOQ3136994

Authors: Bill Jackson, Nicholas Wormald 

Publication date: 1 November 1993

Title of this publication is not available (Why is that?)

Recommendations

• Long cycles and 3-connected spanning subgraphs of bounded degree in 3- connected \(K_{1,d}\)-free graphs
• Longest cycles in regular graphs
• Approximating Longest Cycles in Graphs with Bounded Degrees
• scientific article
• scientific article; zbMATH DE number 568790

zbMATH Keywords

boundslongest cycle3-connected graphs

Mathematics Subject Classification ID

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

Cited In (16)

• Title not available (Why is that?)
• Long cycles and 3-connected spanning subgraphs of bounded degree in 3- connected \(K_{1,d}\)-free graphs
• Large degree vertices in longest cycles of graphs. I
• Finding large cycles in Hamiltonian graphs
• Computing and Combinatorics
• Graphs with almost all edges in long cycles
• Longest cycles in 3-connected planar graphs
• Long cycles in graphs with no subgraphs of minimal degree 3
• Circumference of 3-connected claw-free graphs and large Eulerian subgraphs of 3-edge-connected graphs
• Title not available (Why is that?)
• Relative length of longest paths and cycles in 3-connected graphs
• Edge-diameter of a graph and its longest cycles
• Approximating Longest Cycles in Graphs with Bounded Degrees
• Circumference of Graphs with Bounded Degree
• Long cycles in 3‐connected graphs in orientable surfaces
• Title not available (Why is that?)

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