3 papers
cs.DM2018
Map graphs having witnesses of large girth
Hoang-Oanh Le, Van Bang Le
A half-square of a bipartite graph has one color class of as vertex set, say ; two vertices are adjacent whenever they have a common neighbor in . If $G=(V,…
cs.DM2015
Characterization and recognition of some opposition and coalition graph classes
Van Bang Le, Thomas Podelleck
A graph is an opposition graph, respectively, a coalition graph, if it admits an acyclic orientation which puts the two end-edges of every chordless 4-vertex path in opposition, re…
cs.DM2009
Computing Graph Roots Without Short Cycles
Babak Farzad, Lap Chi Lau, Van Bang Le +1
Graph G is the square of graph H if two vertices x, y have an edge in G if and only if x, y are of distance at most two in H. Given H it is easy to compute its square H2, however M…