The P4-sparse Graph Sandwich Problem

DOI10.1016/j.endm.2005.06.037zbMath1200.05221OpenAlexW1986583595MaRDI QIDQ3439332

Célia Picinin de Mello, Sulamita Klein, Simone Dantas, 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

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

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