On fully orientability of 2-degenerate graphs

DOI10.1016/j.ipl.2007.08.020zbMath1183.05031OpenAlexW2086247931MaRDI QIDQ2380068

Hsin-Hao Lai, Ko-Wei Lih, Gerard Jennhwa Chang

Publication date: 24 March 2010

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: http://ntur.lib.ntu.edu.tw/bitstream/246246/181327/1/02.pdf

zbMATH Keywords

graph algorithmstriangle-free graphacyclic orientation2-degenerate graphcover graphdependent arc

Mathematics Subject Classification ID

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

Related Items (3)

On preserving full orientability of graphs ⋮ Full orientability of graphs with at most one dependent arc ⋮ Full Orientability of Graphs

Cites Work

• Independent arcs of acyclic orientations of complete \(r\)-partite graphs
• A remark on covering graphs
• The number of dependent arcs in an acyclic orientation
• Acyclic orientations of complete bipartite graphs
• Normal hypergraphs and the perfect graph conjecture
• On an interpolation property of outerplanar graphs
• 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: On fully orientability of 2-degenerate graphs