Full Orientability of Graphs

DOI10.1016/j.endm.2009.07.112zbMath1273.05092OpenAlexW2095052208MaRDI QIDQ2851537

Li-Da Tong

Publication date: 10 October 2013

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

Full work available at URL: https://doi.org/10.1016/j.endm.2009.07.112

zbMATH Keywords

acyclic orientationdirected cyclefull orientabilitydependent arcs

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Full orientability of graphs with at most one dependent arc
• 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