Girth in graphs
From MaRDI portal
Publication:792338
DOI10.1016/0095-8956(83)90067-9zbMath0537.05034OpenAlexW2058706196MaRDI QIDQ792338
Publication date: 1983
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0095-8956(83)90067-9
Related Items (49)
\(C_4\)-free subgraphs with large average degree ⋮ Minors in graphs of large girth ⋮ Complete Minors in Graphs Without Sparse Cuts ⋮ On the Hadwiger's conjecture for graph products ⋮ Disjoint cycles in graphs with distance degree sum conditions ⋮ Disjoint cycles in digraphs ⋮ Recent techniques and results on the Erdős-Pósa property ⋮ Some recent progress and applications in graph minor theory ⋮ The circular chromatic number of series-parallel graphs with large girth ⋮ Linear cycles of consecutive lengths ⋮ Cycles of many lengths in Hamiltonian graphs ⋮ Lichiardopol's conjecture on disjoint cycles in tournaments ⋮ A branch‐and‐cut algorithm for a bipartite graph construction problem in digital communication systems ⋮ Cycles with consecutive odd lengths ⋮ Vertex-disjoint cycles of the same length. ⋮ Resolution of the Erdős–Sauer problem on regular subgraphs ⋮ Expander spanning subgraphs with large girth ⋮ Tight bounds for divisible subdivisions ⋮ Small minors in dense graphs ⋮ Graph theory. Abstracts from the workshop held January 2--8, 2022 ⋮ Existence of Spanning ℱ-Free Subgraphs with Large Minimum Degree ⋮ Degree conditions for the existence of vertex-disjoint cycles and paths: a survey ⋮ Triangle-free subgraphs with large fractional chromatic number ⋮ A note on Thomassen's conjecture ⋮ Decomposing graphs into paths of fixed length ⋮ A Conjecture of Verstraëte on Vertex-Disjoint Cycles ⋮ On the 2-extendability of planar graphs ⋮ Cycles through edges in cyclically \(k\)-connected cubic graphs ⋮ Cycle Lengths Modulo k in Large 3-connected Cubic Graphs, Advances in Combinatorics ⋮ The Hadwiger number of infinite vertex-transitive graphs ⋮ Four-cycles in graphs without a given even cycle ⋮ Girth and treewidth ⋮ On the Number of Hamiltonian Cycles in Bipartite Graphs ⋮ Cycles through five edges in 3-connected cubic graphs ⋮ A Separator Theorem for String Graphs and its Applications ⋮ A Separator Theorem for String Graphs and Its Applications ⋮ On perturbations of highly connected dyadic matroids ⋮ On a conjecture of Thomassen concerning subgraphs of large girth ⋮ Decompositions of highly connected graphs into paths of length 3 ⋮ Cycles through four edges in 3-connected cubic graphs ⋮ Edge-decompositions of highly connected graphs into paths ⋮ Dense Induced Subgraphs of Dense Bipartite Graphs ⋮ Disjoint cycles and \(2\)-factors with Fan-type condition in a graph ⋮ Variations on a theme of Kuratowski ⋮ Disjoint Chorded Cycles of the Same Length ⋮ The highly connected matroids in minor-closed classes ⋮ Results and problems on chorded cycles: a survey ⋮ Subgraphs with large degrees and girth ⋮ Cycle lengths modulo \(k\) in expanders
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Graphs having circuits with at least two chords
- Circuits through specified edges
- Circuits containing specified edges
- Existenz gewisser Konfigurationen in \(n\)-gesättigten Graphen und in Graphen genügend großer Kantendichte
- Existenz n-fach zusammenhängender Teilgraphen in Graphen genügend großer Kantendichte
- Graph decomposition with applications to subdivisions and path systems modulo k
- Cycles Modulo k
- On the maximal number of independent circuits in a graph
This page was built for publication: Girth in graphs
