Showing math.COShow all
2 papers · 1 filter
math.CO2024
On graphs which have locally complete 2-edge-colourings and their relationship to proper circular-arc graphs
Jørgen Bang-Jensen, Jing Huang
A 2-edge-coloured graph is called {\bf locally complete} if for each vertex , the vertices adjacent to through edges of the same colour induce a complete subgraph in …
math.CO2019
Good orientations of 2T-graphs
J. Bang-Jensen, S. Bessy, J. Huang +1
In this paper we study graphs which admit acyclic orientations that contain a pair of arc-disjoint out-branching and in-branching (such an orientation is called good) and we focus…