Explicit constructions of graphs without short cycles and low density codes

Type: Article

Publication Date: 1982-03-01

Citations: 321

DOI: https://doi.org/10.1007/bf02579283

Locations

  • COMBINATORICA - View

Similar Works

Action Title Year Authors
+ CONSTRUCTION OF REGULAR GRAPHS WITHOUT SMALL CYCLES 1984 Wilfried Imrich
+ Existence of graphs with specified cycle lengths 1989 William McCuaig
+ Equitable colorings of planar graphs without short cycles 2012 Keaitsuda Maneeruk Nakprasit
Kittikorn Nakprasit
+ The codegree Turán density of tight cycles minus one edge 2022 Simón Piga
Marcelo Sales
Bjarne Schülke
+ PDF Chat Graphs without gap-vertex-labellings: Families and bounds 2023 Celso A. Weffort-Santos
Rafael C. S. Schouery
+ PDF Chat Graph universal cycles: Compression and connections to universal cycles 2023 Rachel Kirsch
Clare Sibley
Elizabeth Sprangel
+ PDF Chat Long Circuits and Large Euler Subgraphs 2013 Fedor V. Fomin
Petr A. Golovach
+ A Sharp Upper Bound on the Cycle Isolation Number of Graphs 2023 Qing Cui
Jingshu Zhang
+ Turán Density of Long Tight Cycle Minus One Hyperedge 2024 József Balogh
Haoran Luo
+ PDF Chat The codegree Tur\'an density of $3$-uniform tight cycles 2024 Simón Piga
Nicolás Sanhueza-Matamala
Mathias Schacht
+ Short rainbow cycles in sparse graphs. 2018 Matt DeVos
Sebastián González Hermosillo de la Maza
Krystal Guo
Daryl Funk
Tony Huynh
Bojan Mohar
Amanda Montejano
+ Small universal families for graphs omitting cliques without GCH 2010 Katherine Thompson
+ Universal sequences and graph cover times A short survey 1990 Arndt Bröder
+ Constructions of full cycles 2024 Tuvi Etzion
+ PDF Chat Short Cycles via Low-Diameter Decompositions 2019 Yang P. Liu
Sushant Sachdeva
Zejun Yu
+ Perfect codes in regular graphs 1988 I. Dvořáková-Rulićová
+ Localised codegree conditions for tight Hamiltonian cycles in 3-uniform hypergraphs 2019 Pedro Araújo
Simón Piga
Mathias Schacht
+ PDF Chat Large Subgraphs without Short Cycles 2015 Florent Foucaud
Michael Krivelevich
Guillem Perarnau
+ PDF Chat Efficient Enumeration of Subgraphs and Induced Subgraphs with Bounded Girth 2018 Kazuhiro Kurita
K. Wasa
Alessio Conte
Takeaki Uno
Hiroki Arimura
+ Dirac-type characterizations of graphs without long chordless cycles 2002 Vašek Chvátal
Irena Rusu
R. Sritharan