Pages that link to "Item:Q3265306"
From MaRDI portal
The following pages link to On maximal paths and circuits of graphs (Q3265306):
Displaying 50 items.
- The Turán number of the graph \(2P_5\) (Q726648) (← links)
- Ramsey numbers of trees versus odd cycles (Q726660) (← links)
- On the multi-colored Ramsey numbers of paths and even cycles (Q727052) (← links)
- Hypergraph extensions of the Erdős-Gallai theorem (Q739066) (← links)
- Invitation to intersection problems for finite sets (Q739389) (← links)
- Degree powers in \(C_5\)-free graphs (Q745946) (← links)
- Long cycles and the codiameter of a graph. I (Q749555) (← links)
- A theorem on cycle-wheel Ramsey number (Q764894) (← links)
- On an extremal problem in graph theory. (Q775325) (← links)
- Minimum degree of 3-graphs without long linear paths (Q776262) (← links)
- Berge cycles in non-uniform hypergraphs (Q783055) (← links)
- Homomorphism thresholds for odd cycles (Q783242) (← links)
- Stability results on the circumference of a graph (Q783243) (← links)
- An Ore-type condition for the existence of two disjoint cycles (Q783683) (← links)
- On restricted colourings of \(K_ n\) (Q793052) (← links)
- Asymptotic solution for a new class of forbidden r-graphs (Q809090) (← links)
- An improved bound for the monochromatic cycle partition number (Q859613) (← links)
- Eigenvalues and forbidden subgraphs. I. (Q869937) (← links)
- Three results on cycle-wheel Ramsey numbers (Q897298) (← links)
- Rainbow cycles in edge-colored graphs (Q906488) (← links)
- Dense arbitrarily partitionable graphs (Q907823) (← links)
- Paths and circuits in g-graphs (Q940975) (← links)
- Pentagons vs. triangles (Q941370) (← links)
- Connected graphs without long paths (Q941391) (← links)
- Long paths with endpoints in given vertex-subsets of graphs (Q941396) (← links)
- The spectral radius of graphs without paths and cycles of specified length (Q962114) (← links)
- A note on the greedy algorithm for finding independent sets of \(C_k\)-free graphs (Q987802) (← links)
- Some three-color Ramsey numbers, \(R(P_4,P_5,C_k)\) and \(R(P_4,P_6,C_k)\) (Q1003590) (← links)
- Monochromatic and heterochromatic subgraphs in edge-colored graphs - A survey (Q1014813) (← links)
- Complete solution for the rainbow numbers of matchings (Q1025962) (← links)
- A variation of a conjecture due to Erdös and Sós (Q1034303) (← links)
- A generalization of Dirac's theorem (Q1065022) (← links)
- Families of finite sets in which no set is covered by the union of \(r\) others (Q1072559) (← links)
- Longest paths joining given vertices in a graph (Q1088682) (← links)
- Small topological complete subgraphs of ``dense'' graphs (Q1101464) (← links)
- Large circuits in binary matroids of large cogirth. I (Q1127871) (← links)
- On path-coverings and Hamilton-connectivity of finite graphs (Q1148335) (← links)
- Maximale Kreise in Graphen (Q1156816) (← links)
- Parallel realization of permutations over trees (Q1163027) (← links)
- Some asymptotic ith Ramsey numbers (Q1170260) (← links)
- Vertex coverings by monochromatic cycles and trees (Q1174783) (← links)
- On a generalization of a theorem of Nash-Williams (Q1179465) (← links)
- Cycles in weighted graphs (Q1180421) (← links)
- Extremal problems involving vertices and edges on odd cycles (Q1197010) (← links)
- All Ramsey numbers for cycles in graphs (Q1212477) (← links)
- On maximal circuits in directed graphs (Q1213883) (← links)
- Alternating Hamiltonian cycles (Q1225065) (← links)
- Développements recents de la théorie des graphes (Q1226996) (← links)
- Generalized Ramsey theory for multiple colors (Q1227014) (← links)
- Equipartite colorings in graphs and hypergraphs (Q1236124) (← links)
