On maximal paths and circuits of graphs
From MaRDI portal
Recommendations
Cites work
Cited in
(only showing first 100 items - show all)- Some three-color Ramsey numbers, R(P₄,P₅,C_k) and R(P₄,P₆,C_k)
- Monochromatic and heterochromatic subgraphs in edge-colored graphs - A survey
- Complete solution for the rainbow numbers of matchings
- A variation of a conjecture due to Erdös and Sós
- 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
- Gaps in the saturation spectrum of trees
- Edge-colorings avoiding a fixed matching with a prescribed color pattern
- On three-color Ramsey numbers \(R(C_{4},K_{1,m},P_{n})\)
- Degree sum conditions on two disjoint cycles in graphs
- Lagrangian densities of some sparse hypergraphs and Turán numbers of their extensions
- The maximum number of cliques in graphs without long cycles
- An Erdős-Gallai type theorem for uniform hypergraphs
- Proof of the Erdős matching conjecture in a new range
- Families with no matchings of size s
- A short proof of Erdős' conjecture for triple systems
- Degree conditions for the existence of vertex-disjoint cycles and paths: a survey
- Stability in the Erdős-Gallai theorem on cycles and paths. II
- Some multicolor bipartite Ramsey numbers involving cycles and a small number of colors
- The size of 3-uniform hypergraphs with given matching number and codegree
- Degree powers in graphs with a forbidden forest
- Erdős-Gallai stability theorem for linear forests
- On the random version of the Erdős matching conjecture
- Spectral extremal results with forbidding linear forests
- The spectral radius of graphs without long cycles
- The number of edges, spectral radius and Hamilton-connectedness of graphs
- Covering a graph with cycles of length at least 4
- Graphs with almost all edges in long cycles
- The Ramsey numbers for a triple of long cycles
- Cycles of given lengths in hypergraphs
- 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
- Tibor Gallai
- 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₄
- Two new sufficient conditions for Hamilton-connected graphs
- Two vertex-disjoint cycles in a graph
- On independent cycles and edges in graphs
- New Ore's type results on hamiltonicity and existence of paths of given length in graphs
- Minimizing the number of edges in \(\mathcal{C}_{\geq r} \)-saturated graphs
- General lemmas for Berge-Turán hypergraph problems
- A short derivation for Turán numbers of paths
- Long cycles, heavy cycles and cycle decompositions in digraphs
- The structure of hypergraphs without long Berge cycles
- An Erdős-Gallai type theorem for vertex colored graphs
- Maximizing the number of cliques in graphs with given matching number
- Properly colored \(C_4\)'s in edge-colored graphs
- On the anti-Ramsey numbers of linear forests
- Spectral analogues of Erdős' theorem on Hamilton-connected graphs
- The Turán number of star forests
- Minimum degree and size conditions for the proper connection number of graphs
- Some generalized bipartite Ramsey numbers involving short cycles
- A variation of the Erdős-Sós conjecture in bipartite graphs
- The extremal \(\alpha \)-index of graphs with no 4-cycle and 5-cycle
- Connected hypergraphs without long Berge-paths
- Spectral extrema of graphs with fixed size: cycles and complete bipartite graphs
- Old and new applications of Katona's circle
- Note on long paths in Eulerian digraphs
- Inverting the Turán problem with chromatic number
- Generalized Turán number of even linear forests
- On the Turán number of theta graphs
- Star-critical Ramsey numbers of cycles versus wheels
- On the maximal colorings of complete graphs without some small properly colored subgraphs
- The Turán number of the square of a path
- Maximum bipartite subgraphs in graphs without short cycles
This page was built for publication: On maximal paths and circuits of graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3265306)
