The following pages link to Girth in graphs (Q792338):
Displaying 42 items.
- Small minors in dense graphs (Q427808) (← links)
- Cycles through five edges in 3-connected cubic graphs (Q581414) (← links)
- Disjoint cycles in digraphs (Q595675) (← links)
- A note on Thomassen's conjecture (Q651042) (← links)
- Girth and treewidth (Q707020) (← links)
- Cycles through four edges in 3-connected cubic graphs (Q753835) (← links)
- On the Hadwiger's conjecture for graph products (Q864168) (← links)
- Some recent progress and applications in graph minor theory (Q878052) (← links)
- Cycles with consecutive odd lengths (Q896065) (← links)
- Edge-decompositions of highly connected graphs into paths (Q1032504) (← links)
- Subgraphs with large degrees and girth (Q1066158) (← links)
- On the 2-extendability of planar graphs (Q1186375) (← links)
- Cycles through edges in cyclically \(k\)-connected cubic graphs (Q1196754) (← links)
- The Hadwiger number of infinite vertex-transitive graphs (Q1204519) (← links)
- Vertex-disjoint cycles of the same length. (Q1405099) (← links)
- Degree conditions for the existence of vertex-disjoint cycles and paths: a survey (Q1706420) (← links)
- On perturbations of highly connected dyadic matroids (Q1787962) (← links)
- Disjoint cycles and \(2\)-factors with Fan-type condition in a graph (Q2075536) (← links)
- Results and problems on chorded cycles: a survey (Q2102760) (← links)
- Cycle lengths modulo \(k\) in expanders (Q2111188) (← links)
- \(C_4\)-free subgraphs with large average degree (Q2130532) (← links)
- Lichiardopol's conjecture on disjoint cycles in tournaments (Q2188844) (← links)
- The highly connected matroids in minor-closed classes (Q2343467) (← links)
- Disjoint cycles in graphs with distance degree sum conditions (Q2400552) (← links)
- Recent techniques and results on the Erdős-Pósa property (Q2403789) (← links)
- Decomposing graphs into paths of fixed length (Q2448964) (← links)
- Variations on a theme of Kuratowski (Q2575783) (← links)
- Expander spanning subgraphs with large girth (Q2689227) (← links)
- Graph theory. Abstracts from the workshop held January 2--8, 2022 (Q2693028) (← links)
- On the Number of Hamiltonian Cycles in Bipartite Graphs (Q2785376) (← links)
- A Separator Theorem for String Graphs and its Applications (Q3058296) (← links)
- A Conjecture of Verstraëte on Vertex-Disjoint Cycles (Q3300756) (← links)
- Four-cycles in graphs without a given even cycle (Q4667796) (← links)
- Minors in graphs of large girth (Q4800396) (← links)
- Complete Minors in Graphs Without Sparse Cuts (Q5068162) (← links)
- Cycles of many lengths in Hamiltonian graphs (Q5102252) (← links)
- Cycle Lengths Modulo k in Large 3-connected Cubic Graphs, Advances in Combinatorics (Q5162867) (← links)
- On a conjecture of Thomassen concerning subgraphs of large girth (Q5199421) (← links)
- Linear cycles of consecutive lengths (Q6051045) (← links)
- A branch‐and‐cut algorithm for a bipartite graph construction problem in digital communication systems (Q6068539) (← links)
- Resolution of the Erdős–Sauer problem on regular subgraphs (Q6169130) (← links)
- Tight bounds for divisible subdivisions (Q6187340) (← links)
