scientific article
From MaRDI portal
Publication:3912829
zbMath0462.05047MaRDI QIDQ3912829
Publication date: 1979
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (27)
Perfect matchings, Hamiltonian cycles and edge-colourings in a class of cubic graphs ⋮ Alternating cycles and paths in edge-coloured multigraphs: A survey ⋮ Accordion graphs: Hamiltonicity, matchings and isomorphism with quartic circulants ⋮ Bipartite graphs with every matching in a cycle ⋮ Extensions to 2-factors in bipartite 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 ⋮ A generalization of properly colored paths and cycles in edge-colored graphs ⋮ Alternating kernels ⋮ Betwixt and between 2-factor Hamiltonian and perfect-matching-Hamiltonian graphs ⋮ Recent advances on the Hamiltonian problem: survey III ⋮ Circuits through specified edges ⋮ Extending perfect matchings to Hamiltonian cycles in line graphs ⋮ Perfect matchings and Hamiltonicity in the Cartesian product of cycles ⋮ Graphs with every matching contained in a cycle ⋮ Compatible Eulerian circuits in Eulerian (di)graphs with generalized transition systems ⋮ How to avoid using the regularity Lemma: Pósa's conjecture revisited ⋮ Compatible Euler tours for transition systems in Eulerian graphs ⋮ Pancyclic graphs and linear forests ⋮ A characterisation of graphs having three pariwise compatible Euler tours ⋮ A degree condition implying that every matching is contained in a Hamiltonian cycle ⋮ On the edge connectivity, Hamiltonicity, and toughness of vertex-transitive graphs ⋮ On 2-factors containing 1-factors in bipartite graphs ⋮ A look at cycles containing specified elements of a graph ⋮ On \(F\)-Hamiltonian graphs ⋮ Proof of a conjecture of Haeggkvist on cycles and independent edges ⋮ Hamiltonian cycles and paths through matchings
This page was built for publication:
