scientific article; zbMATH DE number 3215865

Cited in

(42)

A variation of a theorem by Pósa
Partitioning 2-edge-colored graphs by monochromatic paths and cycles
Embedding Graphs into Larger Graphs: Results, Methods, and Problems
On a Goodman-Hedetniemi sufficient condition for graph Hamiltonicity
Recent advances on the Hamiltonian problem: survey III
Vertex covers by monochromatic pieces -- a survey of results and problems
A note on the linear cycle cover conjecture of Gyárfás and Sárközy
Monochromatic loose-cycle partitions in hypergraphs
New sufficient conditions for cycles in graphs
On a property of 2-connected graphs and Dirac's theorem
Oriented discrepancy of Hamilton cycles
Heavy cycles and spanning trees with few leaves in weighted graphs
Pancyclic graphs and linear forests
Hamiltonian cycles and dominating cycles passing through a linear forest
Partitioning edge-colored hypergraphs into few monochromatic tight cycles
The Turán number of Berge hypergraphs with stable properties
A look at cycles containing specified elements of a graph
Minimum degree, independence number and pseudo \([2, b]\)-factors in graphs
Methods for determining cycles of a specific length in undirected graphs with edge weights
Long cycles in bipartite graphs
The extremal function for two disjoint cycles
Cycles in bipartite graphs
A note on color-bias Hamilton cycles in dense graphs
An implicit degree condition for long cycles in 2-connected graphs
On the discrepancies of graphs
Neighborhood unions and disjoint chorded cycles in graphs
Discrepancies of spanning trees and Hamilton cycles
Hamiltonian numbers in oriented graphs
On a sharp degree sum condition for disjoint chorded cycles in graphs
Vertex partitions of non-complete graphs into connected monochromatic \(k\)-regular graphs
Stability in the Erdős-Gallai theorems on cycles and paths
Disjoint chorded cycles in graphs
Finding long cycles in balanced tripartite graphs: a first step
Neighborhood unions for the existence of disjoint chorded cycles in graphs
Weighted degrees and heavy cycles in weighted graphs
Comparison of sufficient degree based conditions for Hamiltonian graph
A stability version for a theorem of Erdős on nonhamiltonian graphs
Large cycles in graphs
An implicit weighted degree condition for heavy cycles
The number of edges, spectral radius and Hamilton-connectedness of graphs
The binding number of a graph and its Anderson number
Ramsey-type results for path covers and path partitions

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5342985)