4 citations · 6 across the 14 of their papers we have counts for
Showing 2020Show all
3 papers · 1 filter
math.CO2020
Obstructions for acyclic local tournament orientation completions
Kevin Hsu, Jing Huang
The orientation completion problem for a fixed class of oriented graphs asks whether a given partially oriented graph can be completed to an oriented graph in the class. Orientatio…
math.CO2020
(k; l)-Colourings and Ferrers Diagram Representations of Cographs
Dennis A. Epple, Jing Huang
For a pair of natural numbers , a -colouring of a graph is a partition of the vertex set of into (possibly empty) sets , $C_1, C_2, \dots…
math.CO2020
Chordality of locally semicomplete and weakly quasi-transitive digraphs
Jing Huang, Ying Ying Ye
Chordal graphs are important in the structural and algorithmic graph theory. A digraph analogue of chordal graphs was introduced by Haskin and Rose in 1973 but has not been a subje…