Abstract
The P 4 -sparse Graph Sandwich Problem asks, given two graphs G 1 = ( V , E 1 ) and G 2 = ( V , E 2 ) , whether there exists a graph G = ( V , E ) such that E 1 ⊆ E ⊆ E 2 and G is P 4 -sparse. In this paper we present a polynomial-time algorithm for solving the Graph Sandwich Problem for P 4 -sparse graphs.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
