Pages that link to "Item:Q3265306"
From MaRDI portal
The following pages link to On maximal paths and circuits of graphs (Q3265306):
Displayed 50 items.
- Cycles in 2-connected graphs (Q705891) (← links)
- Long cycles and the codiameter of a graph. I (Q749555) (← links)
- On an extremal problem in graph theory. (Q775325) (← 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)
- Pentagons vs. triangles (Q941370) (← links)
- Connected graphs without long paths (Q941391) (← links)
- Long paths with endpoints in given vertex-subsets of graphs (Q941396) (← links)
- Some three-color Ramsey numbers, \(R(P_4,P_5,C_k)\) and \(R(P_4,P_6,C_k)\) (Q1003590) (← 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)
- The maximum number of \(K_j\)-subgraphs in a graph with \(k\) independent edges (Q1242929) (← links)
- A two-person game on graphs where each player tries to encircle his opponent's men (Q1285593) (← links)
- Universal graphs with forbidden subgraphs and algebraic closure (Q1293133) (← links)
- Spaces of symmetric matrices of bounded rank (Q1319988) (← links)
- Partitioning complete bipartite graphs by monochromatic cycles (Q1354726) (← links)
- The Erdös-Sós conjecture for graphs without \(C_ 4\) (Q1362105) (← links)
- The extremal graph problem of the icosahedron (Q1394239) (← links)
- Ramsey numbers involving large dense graphs and bipartite Turán numbers (Q1405120) (← links)
- Graphs with large maximum degree containing no odd cycles of a given length (Q1405126) (← links)
- On completely positive graphs and their complements (Q1406281) (← links)
- Covering vertices of a graph by \(k\) disjoint cycles (Q1406550) (← links)
- Nearly bipartite graphs (Q1412666) (← links)
- Edge-colorings of complete graphs that avoid polychromatic trees (Q1421517) (← links)
- A condition for a graph to contain \(k\)-matching. (Q1422440) (← links)
- Weakly pancyclic graphs (Q1569055) (← links)
- Packing of graphs - a survey (Q1825885) (← links)
- Hamiltonicity of 2-connected quasi-claw-free graphs (Q1827784) (← links)
- Personal reminiscences and remarks on the mathematical work of Tibor Gallai (Q1835908) (← links)
- Tibor Gallai - seventy years old (Q1837176) (← links)
- Tibor Gallai (Q1838469) (← links)