Hits :

First Author : Xu, Fengwei

Affiliation of Author(s): 数理与信息工程学院

Date of Publication : 2015-01-01

Document Type : 期刊

Journal : Ars Combin.

Volume: Vol.122

Page Number : 227-233

ISSN : 0381-7032

Translation or Not : no

Key Words : Cycle;Square;Digraph;Acyclic orientation;Full orientability

Abstract : Let D be an acyclic orientation of a simple graph G. An arc of D is called dependent if its reversal creates a directed cycle. Let d(D) denote the number of dependent arcs in D. Define d(min)(G) (d(max)(G)) to be the minimum (maximum) number of d(D) over