Girth in graphs
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3652373 (Why is no real title available?)
- scientific article; zbMATH DE number 3627227 (Why is no real title available?)
- scientific article; zbMATH DE number 3349865 (Why is no real title available?)
- Circuits containing specified edges
- Circuits through specified edges
- Cycles Modulo k
- 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
- Graphs having circuits with at least two chords
- On the maximal number of independent circuits in a graph
Cited in
(56)- The Hadwiger number of infinite vertex-transitive graphs
- Decomposing graphs into paths of fixed length
- Results and problems on chorded cycles: a survey
- A branch‐and‐cut algorithm for a bipartite graph construction problem in digital communication systems
- Subgraphs with large degrees and girth
- Disjoint Chorded Cycles of the Same Length
- Cycle lengths modulo \(k\) in expanders
- Minors in graphs of large girth
- Ein Struktursatz für 2-fach zusammenhängende Graphen mit großer Minimalvalenz
- Graph theory. Abstracts from the workshop held January 2--8, 2022
- On the Hadwiger's conjecture for graph products
- Vertex-disjoint cycles of the same length.
- Four-cycles in graphs without a given even cycle
- Decompositions of highly connected graphs into paths of length 3
- scientific article; zbMATH DE number 4181377 (Why is no real title available?)
- \(C_4\)-free subgraphs with large average degree
- On the 2-extendability of planar graphs
- Cycles through five edges in 3-connected cubic graphs
- Cycle lengths modulo \(k\) in large 3-connected cubic graphs
- Cohen-Macaulay property of binomial edge ideals with girth of graphs
- Expander spanning subgraphs with large girth
- Cycles through four edges in 3-connected cubic graphs
- Resolution of the Erdős–Sauer problem on regular subgraphs
- Disjoint cycles in digraphs
- An Infinite Graph of Girth 12
- The circular chromatic number of series-parallel graphs with large girth
- Lichiardopol's conjecture on disjoint cycles in tournaments
- Small minors in dense graphs
- A separator theorem for string graphs and its applications
- Some recent progress and applications in graph minor theory
- A conjecture of Verstraëte on vertex-disjoint cycles
- On the number of Hamiltonian cycles in bipartite graphs
- Degree conditions for the existence of vertex-disjoint cycles and paths: a survey
- Tight bounds for divisible subdivisions
- On perturbations of highly connected dyadic matroids
- Cycles with many chords
- Cycles of many lengths in Hamiltonian graphs
- Edge-decompositions of highly connected graphs into paths
- Disjoint cycles in graphs with distance degree sum conditions
- Complete Minors in Graphs Without Sparse Cuts
- Variations on a theme of Kuratowski
- Triangle-free subgraphs with large fractional chromatic number
- Linear cycles of consecutive lengths
- On a conjecture of Thomassen concerning subgraphs of large girth
- scientific article; zbMATH DE number 3189017 (Why is no real title available?)
- A note on Thomassen's conjecture
- The highly connected matroids in minor-closed classes
- Disjoint cycles and \(2\)-factors with Fan-type condition in a graph
- Cycles through edges in cyclically \(k\)-connected cubic graphs
- A Separator Theorem for String Graphs and Its Applications
- Girth and treewidth
- Dense Induced Subgraphs of Dense Bipartite Graphs
- Existence of spanning \(\mathcal{F}\)-free subgraphs with large minimum degree
- Recent techniques and results on the Erdős-Pósa property
- On the number of edges in a \(K_5\)-minor-free graph of given girth
- Cycles with consecutive odd lengths
This page was built for publication: Girth in graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q792338)
