Abstract
Double split graphs form one of the five basic classes in the proof of the strong perfect graph theorem by Chudnovsky et al. [3]. A doubled graph is any induced subgraph of a double split graph. We show here that deciding if a graph G is a doubled graph can be done in time O(|V(G)|+|E(G)|) by analyzing the degree structure of the graph.
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
