4 citations · 8 across the 4 of their papers we have counts for
Showing 2014Show all
2 papers · 1 filter
cs.DM2014
Almost every graph is divergent under the biclique operator
Marina Groshaus, André Guedes, Leandro Montero
A biclique of a graph is a maximal induced complete bipartite subgraph of . The biclique graph of denoted by , is the intersection graph of all the bicliques of $…
cs.DM2014★ 2 cited
Proper Hamiltonian Paths in Edge-Coloured Multigraphs
Raquel Águeda, Valentin Borozan, Marina Groshaus +3
Given a -edge-coloured multigraph, a proper Hamiltonian path is a path that contains all the vertices of the multigraph such that no two adjacent edges have the same colour. In…