Weakly pancyclic graphs

DOI10.1006/jctb.1999.1916zbMath1023.05083OpenAlexW2088896278MaRDI QIDQ1569055

Béla Bollobás, Andrew G. Thomason

Publication date: 25 June 2000

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/jctb.1999.1916

Mathematics Subject Classification ID

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

Related Items

Cycles with a chord in dense graphs, Generalizations of Dirac's theorem in Hamiltonian graph theory -- a survey, Ordering \(Q\)-indices of graphs: given size and circumference, Exact bipartite Turán numbers of large even cycles, Cycle spectra of Hamiltonian graphs, Cycles Embedding in Exchanged Crossed Cube, Embedding Graphs into Larger Graphs: Results, Methods, and Problems, Cycle lengths in sparse graphs, Star-critical Ramsey numbers of cycles versus wheels, Calculating the extremal number \(ex(v;\{C_3,C_4,\dots,C_n\})\), Unnamed Item, Results and problems on chorded cycles: a survey

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Cycles through specified vertices
• The longest cycles in a graph G with minimum degree at least \(| G| /k\)
• Advances in graph theory
• A sufficient condition for all short cycles
• An extremal problem for cycles in hamiltonian graphs
• Pancyclic graphs. I
• On Hamiltonian bipartite graphs
• Paths and circuits in graphs: Extreme cases
• On maximal paths and circuits of graphs
• On a graph theorem by dirac
• Some Theorems on Abstract Graphs