3 papers
cs.DM2019
On the edge-biclique graph and the iterated edge-biclique operator
Leandro Montero, Sylvain Legay
A biclique of a graph is a maximal induced complete bipartite subgraph of . The edge-biclique graph of , , is the edge-intersection graph of the bicliques of …
cs.DS2016
The complexity of tropical graph homomorphisms
Florent Foucaud, Ararat Harutyunyan, Pavol Hell +3
A tropical graph consists of a graph and a (not necessarily proper) vertex-colouring of . Given two tropical graphs and , a homomorphism of $(G,…
cs.CC2016
On computing tree and path decompositions with metric constraints on the bags
Guillaume Ducoffe, Sylvain Legay, Nicolas Nisse
We here investigate on the complexity of computing the \emph{tree-length} and the \emph{tree-breadth} of any graph , that are respectively the best possible upper-bounds on the…