Fast recognition of doubled graphs - Archive ouverte HAL Access content directly
Journal Articles Theoretical Computer Science Year : 2014

Fast recognition of doubled graphs

Frédéric Maffray

Abstract

Double split graphs form one of the five basic classes in the proof of the strong perfect graph theorem by Chudnovsky, Robertson, Seymour and Thomas. 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 linear time by analyzing the degree structure of the graph.

Dates and versions

hal-00945977 , version 1 (13-02-2014)

Identifiers

Cite

Frédéric Maffray. Fast recognition of doubled graphs. Theoretical Computer Science, 2014, 516, pp.96-100. ⟨10.1016/j.tcs.2013.11.020⟩. ⟨hal-00945977⟩
52 View
0 Download

Altmetric

Share

Gmail Facebook X LinkedIn More