A Note on Cycle Lengths in Graphs

A Note on Cycle Lengths in Graphs

Bibliographic Details
Main Authors:	Gould, R, Haxell, P, Scott, A
Format:	Journal article
Published:	2002

Similar Items

A note on intersecting hypergraphs with large cover number
by: Haxell, P, et al.
Published: (2017)

On lower bounds for the matching number of subcubic graphs
by: Haxell, P, et al.
Published: (2016)

An O(Nm) Time Algorithm for Finding the Min Length Directed Cycle in a Graph
by: Sedeno-Noda, Antonio, et al.
Published: (2018)

Maximising the number of induced cycles in a graph
by: Morrison, N, et al.
Published: (2017)

Induced paths in graphs without anticomplete cycles
by: Nguyen, T, et al.
Published: (2023)

Free Edge Lengths in Plane Graphs
by: Connelly, Robert, et al.
Published: (2017)

A note on light geometric graphs
by: Ackerman, Eyal, et al.
Published: (2015)

A note on chromatic uniqueness of graphs /
by: 306081 Chia, Gek-Ling
Published: (1985)

Monochromatic Cycles in 2-Coloured Graphs
by: Benevides, F, et al.
Published: (2012)

Maximising the number of cycles in graphs with forbidden subgraphs
by: Morrison, N, et al.
Published: (2020)

A note on the stability number of an orthogonality graph
by: de Klerk, E, et al.
Published: (2007)

A note on the stability number of an orthogonality graph
by: Klerk, Etienne de., et al.
Published: (2011)

A Note on the Determinants of UK Business Cycles.
by: Day, A, et al.
Published: (1998)

A note on 1-factors of point determining graphs /
by: 306081 Chia, Gek-Ling, et al.
Published: (1981)

On Ryser's conjecture
by: Haxell, P, et al.
Published: (2012)

Cycles in edge-coloured graphs and subgraphs of random graphs
by: White, M
Published: (2011)

Flip cycles in plabic graphs
by: Balitskiy, Alexey, et al.
Published: (2021)

Crux and long cycles in graphs
by: Haslegrave, JGE, et al.
Published: (2022)

Graph theory /
by: 181379 Gould, Ronald
Published: (1988)

Complete graph K4 decomposition into circuits of length 4
by: Mohd Darus, Maizon, et al.
Published: (2014)

Flat Foldings of Plane Graphs with Prescribed Angles and Edge Lengths
by: Demaine, Erik D., et al.
Published: (2015)

Random graphs with few disjoint cycles
by: Kurauskas, V, et al.
Published: (2010)

Changes in atmospheric eddy length with the seasonal cycle and global warming
by: Mooring, Todd A
Published: (2011)

Planar Graphs with the Maximum Number of Induced 4-Cycles or 5-Cycles
by: Savery, M
Published: (2024)

The construction of distinct circuits of length six for complete graph K6
by: Mohd Darus, Maizon, et al.
Published: (2015)

The regularity method for graphs with few 4‐cycles
by: Conlon, David, et al.
Published: (2022)

Ramsey numbers of cycles versus general graphs
by: Haslegrave, J, et al.
Published: (2023)

Duty cycle and pulse length dependence of the acoustic cavitation threshold at megahertz frequencies
by: Calabrese, A, et al.
Published: (1993)

Colour degree matrices of graphs with at most one cycle
by: Hillebrand, A, et al.
Published: (2015)

A note on simplicial cliques
by: Chudnovsky, M, et al.
Published: (2021)

An exact minimum degree condition for Hamilton cycles in oriented graphs
by: Keevash, P, et al.
Published: (2008)

Stochastic processes on graphs with cycles : geometric and variational approaches
by: Wainwright, Martin J. (Martin James), 1973-
Published: (2005)

Tight Hardness for Shortest Cycles and Paths in Sparse Graphs
by: Lincoln, Andrea I, et al.
Published: (2020)

Random unlabelled graphs containing few disjoint cycles.
by: Kang, M, et al.
Published: (2011)

Embedded trees : estimation of Gaussian processes on graphs with cycles
by: Sudderth, Erik B. (Erik Blaine), 1977-
Published: (2014)

A note about the complexity of minimizing Nesterov's smooth Chebyshev-Rosenbrock function.
by: Cartis, C, et al.
Published: (2013)

Solution to a problem of Bollobás and Häggkvist on Hamilton cycles in regular graphs
by: Kühn, D, et al.
Published: (2015)

Packing, counting and covering Hamilton cycles in random directed graphs
by: Ferber, A, et al.
Published: (2017)

A note on the Gyárfás–Sumner conjecture
by: Nguyen, T, et al.
Published: (2024)

Approximating cycles in directed graphs: Fast algorithms for girth and roundtrip spanners
by: Pachocki, J, et al.
Published: (2021)