Two-factors in orientated graphs with forbidden transitions

DOI10.1016/j.disc.2007.12.050zbMath1160.05328OpenAlexW2149237493MaRDI QIDQ998498

Zdeněk Dvořák

Publication date: 28 January 2009

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2007.12.050

zbMATH Keywords

complexitydichotomy2-factorsallowed transitionorientated graph

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Directed graphs (digraphs), tournaments (05C20)

Related Items (5)

Some Hamiltonian Properties of One-Conflict Graphs ⋮ Separating codes and traffic monitoring ⋮ The complexity of routing problems in forbidden-transition graphs and edge-colored graphs ⋮ Unnamed Item ⋮ Trees in Graphs with Conflict Edges or Forbidden Transitions

Cites Work

• Eulerian graphs and related topics. Part 1, Volume 1
• Compatible 2-factors
• Finding paths in graphs avoiding forbidden transitions
• An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs
• Unnamed Item
• Unnamed Item

This page was built for publication: Two-factors in orientated graphs with forbidden transitions