Linked graphs with restricted lengths
From MaRDI portal
Publication:933678
DOI10.1016/j.jctb.2007.11.004zbMath1149.05024OpenAlexW2035541146MaRDI QIDQ933678
Guantao Chen, Shuhong Gao, Yuan Chen, Zhi-quan Hu
Publication date: 24 July 2008
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jctb.2007.11.004
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Highly parity linked graphs
- Topological subgraphs in graphs of large girth
- An improved linear edge bound for graph linkages
- Distribution of cycle lengths in graphs
- On the odd-minor variant of Hadwiger's conjecture
- Eine Verallgemeinerung des \(n\)-fachen Zusammenhangs für Graphen
- Highly linked graphs
- On Arithmetic Progressions of Cycle Lengths in Graphs
- On Sufficient Degree Conditions for a Graph to be $k$-linked
- Ordered and linked chordal graphs
- Graph decomposition with applications to subdivisions and path systems modulo k
- Cycles Modulo k
- Cycles and semi-topological configurations
- K-linked graphs with girth condition
- On the addition of residue classes mod p
- An addition theorem for the elementary abelian group
- On the Existence of Certain Configurations within Graphs and the 1-Skeletons of Polytopes
- The Erdős-Pósa property for odd cycles in graphs of large connectivity
This page was built for publication: Linked graphs with restricted lengths
