Graphs with at most two moplexes

Cl{\'{e}}ment Dallard, Robert Ganian, Meike Hatzel, Matjaz Krnc, Martin Milanic
January 2021
bib Project Project

Abstract

Full Citation:

Cl'ement Dallard, Robert Ganian, Meike Hatzel, Matjaz Krnc, Martin Milanic. Graphs with at most two moplexes. Journal of Graph Theory, 2021, Wiley Online Library.

Type
Journal Article
ParAI Nfpc
Robert Ganian
Robert Ganian

Robert Ganian is a Professor at the Algorithms and Complexity Group.