On maximal paths and circuits of graphs

05C35: Extremal problems in graph theory

05C38: Paths and cycles

05C45: Eulerian and Hamiltonian graphs

Related Items

Ramsey Size Linear Graphs, Unnamed Item, Unnamed Item, Flots et tensions dans un graphe, Extensions of Turán's theorem on graphs, Generalized and geometric Ramsey numbers for cycles., Spaces of \(p\)-vectors of bounded rank, Cycles in 2-connected graphs, Long cycles and the codiameter of a graph. I, On an extremal problem in graph theory., On restricted colourings of \(K_ n\), Asymptotic solution for a new class of forbidden r-graphs, An improved bound for the monochromatic cycle partition number, Eigenvalues and forbidden subgraphs. I., Pentagons vs. triangles, Connected graphs without long paths, Long paths with endpoints in given vertex-subsets of graphs, Some three-color Ramsey numbers, \(R(P_4,P_5,C_k)\) and \(R(P_4,P_6,C_k)\), A generalization of Dirac's theorem, Families of finite sets in which no set is covered by the union of \(r\) others, Longest paths joining given vertices in a graph, Small topological complete subgraphs of ``dense graphs, Large circuits in binary matroids of large cogirth. I, On path-coverings and Hamilton-connectivity of finite graphs, Maximale Kreise in Graphen, Parallel realization of permutations over trees, Some asymptotic ith Ramsey numbers, Vertex coverings by monochromatic cycles and trees, On a generalization of a theorem of Nash-Williams, Cycles in weighted graphs, Extremal problems involving vertices and edges on odd cycles, All Ramsey numbers for cycles in graphs, On maximal circuits in directed graphs, Alternating Hamiltonian cycles, Développements recents de la théorie des graphes, Generalized Ramsey theory for multiple colors, Equipartite colorings in graphs and hypergraphs, The maximum number of \(K_j\)-subgraphs in a graph with \(k\) independent edges, A two-person game on graphs where each player tries to encircle his opponent's men, Universal graphs with forbidden subgraphs and algebraic closure, Spaces of symmetric matrices of bounded rank, Partitioning complete bipartite graphs by monochromatic cycles, The Erdös-Sós conjecture for graphs without \(C_ 4\), The extremal graph problem of the icosahedron, Ramsey numbers involving large dense graphs and bipartite Turán numbers, Graphs with large maximum degree containing no odd cycles of a given length, On completely positive graphs and their complements, Covering vertices of a graph by \(k\) disjoint cycles, Nearly bipartite graphs, Edge-colorings of complete graphs that avoid polychromatic trees, A condition for a graph to contain \(k\)-matching., Weakly pancyclic graphs, Tibor Gallai, Packing of graphs - a survey, Hamiltonicity of 2-connected quasi-claw-free graphs, Personal reminiscences and remarks on the mathematical work of Tibor Gallai, Tibor Gallai - seventy years old, Path Ramsey numbers in multicolorings, Rainbow numbers for matchings and complete graphs, The Erdős-Sós conjecture for graphs whose complements contain no \(C_4\), Two new sufficient conditions for Hamilton-connected graphs, Two vertex-disjoint cycles in a graph, On independent cycles and edges in graphs, Extremal graph problems with symmetrical extremal graphs. Additional chromatic conditions, Minimal paths and cycles in set systems, Disjoint complete minors and bipartite minors, On some extremal problems in graph theory, The Erdős-Sós conjecture for spiders, The codiameter of a 2-connected graph, Cycles and stability, Breaking the rhythm on graphs, A spectral condition for odd cycles in graphs, On mutually independent Hamiltonian paths, On the Turán number for the hexagon, Large cycles in graphs, Ramsey numbers for cycles in graphs, On the existence of triangulated spheres in 3-graphs, and related problems, Minimal colorings for properly colored subgraphs, On Hamiltonian bipartite graphs, On the structure of linear graphs, Paths and circuits in graphs: Extreme cases, Maximal circuits of graphs. I

Cites Work