Graphs with two moplexes

DOI10.1016/J.PROCS.2021.11.031MaRDI QIDQ6890898zbMATH OpenFDO

Authors Clément Dallard, Robert Ganian, Meike Hatzel, Matjaž Krnc, Martin Milanič

Publication date 2 December 2025

Published in Procedia Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.PROCS.2021.11.031

zbMATH Keywords

asteroidal numberavoidable vertexcocomparability graphHamiltonian pathmoplexsimplicial vertex

Mathematics Subject Classification ID

Structural characterization of families of graphs (05C75)

Cited in

(1)

• Obstructions to faster diameter computation: asteroidal sets

This page was built for publication: Graphs with two moplexes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6890898)