Regularity and locality in \(k\)-terminal graphs
type: Item
instance of: scholarly article
title: Regularity and locality in \(k\)-terminal graphs
zbMATH Open document ID: 0822.68084
DOI: 10.1016/0166-218X(94)90025-6
author: Sanjeev Mahajan
author: Joseph G. Peters
published in: Discrete Applied Mathematics
publication date: 1994-11-28T00:00:00Z
Mathematics Subject Classification ID: 68R10
Mathematics Subject Classification ID: 05C05
Mathematics Subject Classification ID: 05C78
zbMATH DE Number: 681641
zbMATH Keywords: regular graph properties
zbMATH Keywords: \(k\)-terminal recursive graphs
zbMATH Keywords: parse tree
zbMATH Keywords: linear-time algorithm
MaRDI profile type: Publication
cites work: Efficient algorithms for combinatorial problems on graphs with bounded decomposability - a survey
cites work: Complexity of Finding Embeddings in a k-Tree
cites work: Q3812222
cites work: Characterization and Recognition of Partial 3-Trees
cites work: Linear time algorithms for NP-hard problems restricted to partial k- trees
cites work: Automatic generation of linear-time algorithms from predicate calculus descriptions of problems on recursively constructed graph families
cites work: The monadic second-order logic of graphs. I: Recognizable sets of finite graphs
cites work: Q5592246
cites work: Q3692864
cites work: Linear-time computability of combinatorial problems on series-parallel graphs
cites work: Q3822197
cites work: Q3740231
description: scientific article; zbMATH DE number 681641