On maximal paths and circuits of graphs
From MaRDI portal
Publication:3265306
Recommendations
Cites work
Cited in
(only showing first 100 items - show all)- Long paths and cycles passing through specified vertices under the average degree condition
- Anti-Ramsey number of matchings in hypergraphs
- Disjoint directed cycles with specified lengths in directed bipartite graphs
- Développements recents de la théorie des graphes
- Some generalized bipartite Ramsey numbers involving short cycles
- Many \(T\) copies in \(H\)-free graphs
- Nearly-regular hypergraphs and saturation of Berge stars
- Spectral analogues of Erdős' theorem on Hamilton-connected graphs
- Extremal numbers for odd cycles
- Longest paths joining given vertices in a graph
- Degree conditions for embedding trees
- The k‐path vertex cover: General bounds and chordal graphs
- Hamiltonicity of 2-connected quasi-claw-free graphs
- Extensions of the Erdős-Gallai theorem and Luo's theorem
- Energy conditions for Hamiltonicity of graphs
- Rainbow matchings in properly-colored hypergraphs
- Avoiding long Berge cycles: the missing cases \(k=r+1\) and \(k=r+2\)
- \(\mathcal{F}\)-saturation games
- Ordering \(Q\)-indices of graphs: given size and circumference
- Ramsey numbers for cycles in graphs
- The maximum number of K_j-subgraphs in a graph with k independent edges
- On Generalized Turán Results in Height Two Posets
- A stability result of the Pósa lemma
- Avoiding long Berge cycles
- On \(r\)-uniform hypergraphs with circumference less than \(r\)
- Signless Laplacian spectral conditions for Hamiltonicity of graphs
- Coloring powers and girth
- On Hamiltonian bipartite graphs
- An Erdős-Gallai type theorem for vertex colored graphs
- Maximum bipartite subgraphs in $H$-free graphs
- The extremal function for partial bipartite tilings
- On the optimality of Bellman-Ford-Moore shortest path algorithm
- On some three-color Ramsey numbers for paths
- Rainbow Turán problems for paths and forests of stars
- Some remarks on long monochromatic cycles in edge-colored complete graphs
- Localized versions of extremal problems
- The extremal function for disconnected minors
- The extremal graph problem of the icosahedron
- Degree versions of the Erdős-Ko-Rado theorem and Erdős hypergraph matching conjecture
- On the maximal colorings of complete graphs without some small properly colored subgraphs
- Turán numbers for hypergraph star forests
- On the rainbow Turán number of paths
- A spectral condition for odd cycles in graphs
- Maximum and minimum degree conditions for embedding trees
- Maximum graphs non-Hamiltonian-connected from a vertex
- Long cycles and the codiameter of a graph. I
- The spectral radius of graphs without trees of diameter at most four
- A stability result on matchings in 3-uniform hypergraphs
- Cycles in 2-connected graphs
- The Turán number of star forests
- Improved bound on vertex degree version of Erdős matching conjecture
- The maximum number of copies of \(K_{r,s}\) in graphs without long cycles or paths
- Alternating Hamiltonian cycles
- Flots et tensions dans un graphe
- Hypergraphs with no cycle of length 4
- Ramsey and Gallai-Ramsey numbers for the union of paths and stars
- Hypergraphs with no cycle of a given length
- Partitioning 2-edge-colored graphs by monochromatic paths and cycles
- Minimal paths and cycles in set systems
- Graph invariants and large cycles: a survey
- Maxima of the \(Q\)-index: forbidden a Fan
- Extremal graphs without long paths and large cliques
- Structure of the largest subgraphs of \(G_{n , p}\) with a given matching number
- Counting H-free orientations of graphs
- Extremal Problems for Hypergraph Blowups of Trees
- A Brualdi-Hoffman-Turán problem on cycles
- Large \(Y_{3,2}\)-tilings in 3-uniform hypergraphs
- The Turán number of \(P_9 \cup P_7\)
- Spectral radius and rainbow Hamilton paths of a graph
- The Turán numbers of special forests
- A stability theorem for maximal C2k+1 ${C}_{2k+1}$‐free graphs
- Embedding Graphs into Larger Graphs: Results, Methods, and Problems
- The Turań number of \(2P_7\)
- The spectral radius of graphs with no intersecting odd cycles
- The maximum spectral radius of graphs without spanning linear forests
- Families with no matchings of size s
- Weakly pancyclic graphs
- On the anti-Ramsey number of forests
- A sufficient degree condition for a graph to contain all trees of size \(k\)
- Degree conditions and relative length of longest paths and cycles in graphs
- The signless Laplacian spectral radius of graphs with forbidding linear forests
- Counterexamples to Gerbner's conjecture on stability of maximal F‐free graphs
- On three-color Ramsey numbers \(R(C_{4},K_{1,m},P_{n})\)
- On the multi-colored Ramsey numbers of cycles
- Complete solution for the rainbow numbers of matchings
- Connected hypergraphs without long Berge-paths
- An Improved Bound for Vertex Partitions by Connected Monochromatic K-Regular Graphs
- Spectral conditions for traceability of connected claw-free graphs
- A variation of the Erdős-Sós conjecture in bipartite graphs
- The spectral radius of graphs without long cycles
- Two problems on matchings in set families -- in the footsteps of Erdős and Kleitman
- The spectral radius of graphs without paths and cycles of specified length
- Linear trees in uniform hypergraphs
- Parallel realization of permutations over trees
- On the existence of triangulated spheres in 3-graphs, and related problems
- Improved bounds for Erdős' matching conjecture
- Large matchings in uniform hypergraphs and the conjectures of Erdős and samuels
- Properly colored \(C_4\)'s in edge-colored graphs
- Extremal graphs for two vertex-disjoint copies of a clique
- An \(A_\alpha\)-spectral Erdős-Pósa theorem
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)
