scientific article; zbMATH DE number 3722690
From MaRDI portal
Publication:3912829
Cited in
(31)- Pancyclic graphs and linear forests
- A degree condition implying that every matching is contained in a Hamiltonian cycle
- A look at cycles containing specified elements of a graph
- Proof of a conjecture of Haeggkvist on cycles and independent edges
- Circuits through specified edges
- A characterisation of graphs having three pariwise compatible Euler tours
- On 2-factors containing 1-factors in bipartite graphs
- On \(F\)-Hamiltonian graphs
- Alternating cycles and paths in edge-coloured multigraphs: A survey
- On the edge connectivity, Hamiltonicity, and toughness of vertex-transitive graphs
- Alternating kernels
- Compatible Eulerian circuits in Eulerian (di)graphs with generalized transition systems
- Perfect matchings and Hamiltonicity in the Cartesian product of cycles
- Accordion graphs: Hamiltonicity, matchings and isomorphism with quartic circulants
- Extending perfect matchings to Hamiltonian cycles in line graphs
- Recent advances on the Hamiltonian problem: survey III
- A generalization of properly colored paths and cycles in edge-colored graphs
- Betwixt and between 2-factor Hamiltonian and perfect-matching-Hamiltonian graphs
- Hamiltonian cycles and paths through matchings
- Extensions to 2-factors in bipartite graphs
- Compatible Euler tours for transition systems in Eulerian graphs
- Perfect matchings, Hamiltonian cycles and edge-colourings in a class of cubic graphs
- A degree condition for cycles passing through specified vertices and edges
- Hamilton cycles passing through a matching in a bipartite graph with high degree sum
- Cycles of length 3 and 4 in edge-colored complete graphs with restrictions in the color transitions
- Graphs with every matching contained in a cycle
- Cycle partitions in dense regular digraphs and oriented graphs
- Cycle partition of dense regular digraphs and oriented graphs (extended abstract)
- The Pairing-Hamiltonian property in graph prisms
- Bipartite graphs with every matching in a cycle
- How to avoid using the regularity Lemma: Pósa's conjecture revisited
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 Q3912829)