The P4-sparse Graph Sandwich Problem

DOI10.1016/J.ENDM.2005.06.037MaRDI QIDQ3439332zbMATH OpenOpenAlexFDO

Authors Simone Dantas, Sulamita Klein, Célia P. de Mello, Aurora Morgana

Publication date 29 May 2007

Published in Electronic Notes in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.endm.2005.06.037

zbMATH Keywords

algorithmscomputational complexitygraph sandwich problems

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85)

Cites work

• A tree representation for \(P_ 4\)-sparse graphs
• Graph Sandwich Problems
• Modular decomposition and transitive orientation
• On decision and optimization (\(k\),\(l\))-graph sandwich problems
• The graph sandwich problem for 1-join composition is NP-complete
• The homogeneous set sandwich problem

This page was built for publication: The P4-sparse Graph Sandwich Problem

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