Locally connected spanning trees in cographs, complements of bipartite graphs and doubly chordal graphs
type: Item
instance of: scholarly article
title: Locally connected spanning trees in cographs, complements of bipartite graphs and doubly chordal graphs
zbMATH Open document ID: 1379.05111
author: Peng Zhang
published in: Information Processing Letters
publication date: 2017-11-03T00:00:00Z
Mathematics Subject Classification ID: 05C85
Mathematics Subject Classification ID: 05C75
Mathematics Subject Classification ID: 68Q25
zbMATH DE Number: 6802677
zbMATH Keywords: algorithms
zbMATH Keywords: graph algorithms
zbMATH Keywords: locally connected spanning tree
zbMATH Keywords: NP-completeness
MaRDI profile type: Publication
full work available at URL: j.ipl.2010.09.008
OpenAlex ID: W2038917364
cites work: Dually Chordal Graphs
cites work: Networks immune to isolated failures
cites work: Locally connected spanning trees in strongly chordal graphs and proper circular-arc graphs
cites work: A Linear Recognition Algorithm for Cographs
cites work: Complement reducible graphs
cites work: Incidence matrices and interval graphs
cites work: Steiner trees, partial 2–trees, and minimum IFI networks
cites work: On spanning 2-trees in a graph
cites work: The complexity of the locally connected spanning tree problem
cites work: Q4221384
DOI: 10.1016/J.IPL.2010.09.008
description: scientific article; zbMATH DE number 6802677