Hamiltonicity and reversing arcs in digraphs

DOI<link itemprop=identifier href="https://doi.org/10.1002/(SICI)1097-0118(199805)28:1<13::AID-JGT2>3.0.CO;2-I" /><13::AID-JGT2>3.0.CO;2-I 10.1002/(SICI)1097-0118(199805)28:1<13::AID-JGT2>3.0.CO;2-IzbMath0919.05041OpenAlexW4242462538MaRDI QIDQ4242794

William F. Klostermeyer, Ľubomír Šoltés

Publication date: 31 August 1999

Full work available at URL: https://doi.org/10.1002/(sici)1097-0118(199805)28:1<13::aid-jgt2>3.0.co;2-i

zbMATH Keywords

tournamentHamiltonian digraphHamilton cyclecyclable complete multipartite graphsvertex push

Mathematics Subject Classification ID

Structural characterization of families of graphs (05C75) Directed graphs (digraphs), tournaments (05C20) Eulerian and Hamiltonian graphs (05C45)

Related Items (11)

Pushing vertices in digraphs without long induced cycles ⋮ On homomorphisms of oriented graphs with respect to the push operation ⋮ On oriented cliques with respect to push operation ⋮ Cops and robber on oriented graphs with respect to push operation ⋮ On the pushable chromatic number of various types of grids ⋮ Homomorphisms and oriented colorings of equivalence classes of oriented graphs ⋮ Pushable chromatic number of graphs with degree constraints ⋮ Acyclically pushable bipartite permutation digraphs: an algorithm ⋮ An Ore-type condition for cyclability ⋮ Neighborhood unions and cyclability of graphs ⋮ A fan-type condition for cyclability

This page was built for publication: Hamiltonicity and reversing arcs in digraphs