3 citations · 3 across the 5 of their papers we have counts for
5 papers · 1 filter
Equitable Coloring of Graphs with Intermediate Maximum Degree
Bor-Liang Chen, Kuo-Ching Huang, Ko-Wei Lih
If the vertices of a graph are colored with colors such that no adjacent vertices receive the same color and the sizes of any two color classes differ by at most one, then…
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…
Full Orientability of the Square of a Cycle
Fengwei Xu, Weifan Wang, Ko-Wei Lih
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. De…
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…
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…