Whitney's 2-switching theorem, cycle spaces, and arc mappings of directed graphs

DOI10.1016/0095-8956(89)90050-6zbMath0667.05028OpenAlexW2067852932MaRDI QIDQ1117243

Carsten Thomassen

Publication date: 1989

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0095-8956(89)90050-6

zbMATH Keywords

cycle spacetournamentsisomorphismanti-isomorphismarc mappings

Mathematics Subject Classification ID

Paths and cycles (05C38) Directed graphs (digraphs), tournaments (05C20)

Related Items

Linear transformations of tropical matrices preserving the cyclicity index ⋮ Mutation on knots and Whitney's 2-isomorphism theorem ⋮ The arborescence-realization problem ⋮ Non-Critical Vertices and Long Circuits in Strong Tournaments of Order n and Diameter d ⋮ Description of the tournaments which are reconstructible from their \(k\)-cycle partial digraphs for \(k\in \{3, 4\}\) ⋮ Cycle bases from orderings and coverings ⋮ On the number of non-critical vertices in strong tournaments of order \(N\) with minimum out-degree \(\delta ^{+}\) and in-degree \(\delta ^{ - }\) ⋮ Ear decomposition for pair comparison data ⋮ Spanning 2-forests and resistance distance in 2-connected graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Long cycles generate the cycle space of a graph
• On the number of Hamiltonian cycles in tournaments
• Planarity and duality of finite and infinite graphs
• Cycles through specified vertices of a graph
• Duality of infinite graphs
• Cycles in digraphs– a survey
• On Whitney's 2‐isomorphism theorem for graphs
• Arc Mappings and Tournament Isomorphisms
• How to Draw a Graph