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.
- 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)
- Gaps in the saturation spectrum of trees (Q1630934) (← links)
- Edge-colorings avoiding a fixed matching with a prescribed color pattern (Q1631619) (← links)
- On three-color Ramsey numbers \(R(C_{4},K_{1,m},P_{n})\) (Q1633285) (← links)
- Degree sum conditions on two disjoint cycles in graphs (Q1653021) (← links)
- Lagrangian densities of some sparse hypergraphs and Turán numbers of their extensions (Q1663794) (← links)
- The maximum number of cliques in graphs without long cycles (Q1682216) (← links)
- An Erdős-Gallai type theorem for uniform hypergraphs (Q1686258) (← links)
- Proof of the Erdős matching conjecture in a new range (Q1686318) (← links)
- Families with no matchings of size \(s\) (Q1689961) (← links)
- A short proof of Erdős' conjecture for triple systems (Q1701428) (← links)
- Degree conditions for the existence of vertex-disjoint cycles and paths: a survey (Q1706420) (← links)
- Stability in the Erdős-Gallai theorem on cycles and paths. II (Q1709520) (← links)
- Some multicolor bipartite Ramsey numbers involving cycles and a small number of colors (Q1709532) (← links)
- The size of 3-uniform hypergraphs with given matching number and codegree (Q1712519) (← links)
- Degree powers in graphs with a forbidden forest (Q1712530) (← links)
- Erdős-Gallai stability theorem for linear forests (Q1712542) (← links)
- On the random version of the Erdős matching conjecture (Q1720300) (← links)
- Spectral extremal results with forbidding linear forests (Q1733881) (← links)
- The spectral radius of graphs without long cycles (Q1736228) (← links)
- The number of edges, spectral radius and Hamilton-connectedness of graphs (Q1752616) (← links)
- Covering a graph with cycles of length at least 4 (Q1753038) (← links)
- Graphs with almost all edges in long cycles (Q1756098) (← links)
- The Ramsey numbers for a triple of long cycles (Q1786049) (← links)
- Cycles of given lengths in hypergraphs (Q1791703) (← 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)