On Chordal-k-Generalized Split Graphs release_woxmytt6izf6xpqv2f2kl3bvxa

by Andreas Brandstädt, Raffaele Mosca

Released as a article .

2017  

Abstract

A graph G is a chordal-k-generalized split graph if G is chordal and there is a clique Q in G such that every connected component in G[V ∖ Q] has at most k vertices. Thus, chordal-1-generalized split graphs are exactly the split graphs. We characterize chordal-k-generalized split graphs by forbidden induced subgraphs. Moreover, we characterize a very special case of chordal-2-generalized split graphs for which the Efficient Domination problem is -complete.
In text/plain format

Archived Files and Locations

application/pdf  158.5 kB
file_efyzqzzoxjcd7pwkg2jujvkgmq
arxiv.org (repository)
web.archive.org (webarchive)
Read Archived PDF
Preserved and Accessible
Type  article
Stage   submitted
Date   2017-03-06
Version   v2
Language   en ?
arXiv  1702.07914v2
Work Entity
access all versions, variants, and formats of this works (eg, pre-prints)
Catalog Record
Revision: 3cbbc930-cf94-4fdf-aaff-bda066df2bce
API URL: JSON