Full orientability of graphs with at most one dependent arc

DOI10.1016/j.dam.2009.04.013zbMath1211.05053OpenAlexW2011930523MaRDI QIDQ967346

Hsin-Hao Lai, Li-Da Tong, Ko-Wei Lih

Publication date: 28 April 2010

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

Full work available at URL: https://doi.org/10.1016/j.dam.2009.04.013

zbMATH Keywords

acyclic orientationcanonical decompositiondependent arcfull orientabilitysource-reversal

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20)

Related Items (1)

Full Orientability of Graphs

Cites Work

• Unnamed Item
• On preserving full orientability of graphs
• Independent arcs of acyclic orientations of complete \(r\)-partite graphs
• On graphs that can be oriented as diagrams of ordered sets
• On reorienting graphs by pushing down maximal vertices
• The number of dependent arcs in an acyclic orientation
• On reorienting graphs by pushing down maximal vertices. II
• Source reversal and chip firing on graphs
• Acyclic orientations of complete bipartite graphs
• On fully orientability of 2-degenerate graphs
• On an interpolation property of outerplanar graphs
• Cycle Lengths and Graph Orientations
• Dependent edges in Mycielski graphs and 4‐colorings of 4‐skeletons
• On Cover Graphs and Dependent Arcs in Acyclic Orientations

This page was built for publication: Full orientability of graphs with at most one dependent arc