Showing math.COShow all
3 papers · 1 filter
math.CO2012
The Minimum Number of Dependent Arcs and a Related Parameter of Generalized Mycielski Graphs
Hsin-Hao Lai, Ko-Wei Lih
Let D be an acyclic orientation of the graph G. An arc of D is dependent if its reversal creates a directed cycle. Let m(G) denote the minimum number of dependent arcs over all acy…
math.CO2012
When is the Direct Product of Generalized Mycielskians a Cover Graph?
Hsin-Hao Lai, Ko-Wei Lih, Chen-Ying Lin +1
A graph is said to be a cover graph if it is the underlying graph of the Hasse diagram of a finite partially ordered set. The direct product G X H of graphs G and H is the graph ha…
math.CO2012
Chordal Graphs are Fully Orientable
Hsin-Hao Lai, Ko-Wei Lih
Suppose that D is an acyclic orientation of a graph G. An arc of D is called dependent if its reversal creates a directed cycle. Let m and M denote the minimum and the maximum of t…