scientific article; zbMATH DE number 1796975
From MaRDI portal
Publication:4551369
zbMath0993.05136MaRDI QIDQ4551369
Publication date: 5 September 2002
Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2108/21080308
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (10)
A linear time algorithm to list the minimal separators of chordal graphs ⋮ Disconnected matchings ⋮ Proximity Search for Maximal Subgraph Enumeration ⋮ The 3-Steiner Root Problem ⋮ Treewidth versus clique number. II: Tree-independence number ⋮ Counting the number of independent sets in chordal graphs ⋮ Efficient enumeration of maximal \(k\)-degenerate induced subgraphs of a chordal graph ⋮ Girth and treewidth ⋮ Generalized subgraph-restricted matchings in graphs ⋮ Disconnected matchings
This page was built for publication:
