scientific article; zbMATH DE number 3547317
From MaRDI portal
Publication:4121920
Problem books (00A07) Research exposition (monographs, survey articles) pertaining to combinatorics (05-02) Other designs, configurations (05B30) Combinatorial aspects of matroids and geometric lattices (05B35) Coloring of graphs and hypergraphs (05C15) Extremal problems in graph theory (05C35) Research exposition (monographs, survey articles) pertaining to number theory (11-02)
Recommendations
Cited in
(29)- The ubiquitous Petersen graph
- Some graphs with chromatic number three
- Semi-topological subgraphs
- Cycles of length 0 modulo 4 in graphs
- Some recent problems and results in graph theory
- Cycle lengths and minimum degree of graphs
- Cycles of given lengths in hypergraphs
- Large numbers, Knuth's arrow notation, and Ramsey theory
- Cycle lengths in expanding graphs
- Cycle lengths modulo k in expanders
- scientific article; zbMATH DE number 7232795 (Why is no real title available?)
- scientific article; zbMATH DE number 3869331 (Why is no real title available?)
- scientific article; zbMATH DE number 5158880 (Why is no real title available?)
- scientific article; zbMATH DE number 3739641 (Why is no real title available?)
- scientific article; zbMATH DE number 3749050 (Why is no real title available?)
- scientific article; zbMATH DE number 3561378 (Why is no real title available?)
- SOME OF MY FAVORITE SOLVED AND UNSOLVED PROBLEMS IN GRAPH THEORY
- scientific article; zbMATH DE number 568818 (Why is no real title available?)
- scientific article; zbMATH DE number 568826 (Why is no real title available?)
- scientific article; zbMATH DE number 1779834 (Why is no real title available?)
- Cycle lengths modulo \(k\) in large 3-connected cubic graphs
- Linear cycles of consecutive lengths
- Minimum degree conditions for the existence of a sequence of cycles whose lengths differ by one or two
- 4-Chromatic graphs have at least four cycles of length 0 mod 3
- On graphs without cycles of length 0 modulo 4
- A strengthening on consecutive odd cycles in graphs of given minimum degree
- Maximum number of cliques in \(\{C_{k_1}, C_{k_2}, C_{k_3}, \cdots \}\)-free graphs with \(6 = k_1 < k_2 < \cdots\) and \(k_{i+1} - k_i \leq 5\)
- Cycle lengths in graphs of given minimum degree
- Linked graphs with restricted lengths
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4121920)
