Skip to content
VuFind
English
Deutsch
Español
Français
Italiano
日本語
Nederlands
Português
Português (Brasil)
中文(简体)
中文（繁體）
Türkçe
עברית
Gaeilge
Cymraeg
Ελληνικά
Català
Euskara
Русский
Čeština
Suomi
Svenska
polski
Dansk
slovenščina
اللغة العربية
বাংলা
Galego
Tiếng Việt
Hrvatski
हिंदी
Հայերէն
Українська
Sámegiella
Монгол
Language
All Fields
Title
Author
Subject
Call Number
ISBN/ISSN
Tag
Find
Advanced
A Note on Cycle Lengths in Gr...
Cite this
Text this
Email this
Print
Export Record
Export to RefWorks
Export to EndNoteWeb
Export to EndNote
Permanent link
A Note on Cycle Lengths in Graphs
Bibliographic Details
Main Authors:
Gould, R
,
Haxell, P
,
Scott, A
Format:
Journal article
Published:
2002
Holdings
Description
Similar Items
Staff View
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)