Block-Graph Width

DOI10.1007/978-3-642-02017-9_18MaRDI QIDQ3630199zbMATH OpenOpenAlexFDO

Authors Ling-Ju Hung, Ton Kloks, Sheng-Lung Peng, Maw-Shang Chang

Publication date 3 June 2009

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-02017-9_18

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Graph algorithms (graph-theoretic aspects) (05C85) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Recommendations

• Block-graph width
• On some simple widths
• Trivially-perfect width
• Bandwidth and density for block graphs
• Block elimination distance

Cited in

(5)

• On some simple widths
• Trivially-perfect width
• Block-graph width
• Block elimination distance
• On two variants of split graphs: 2-unipolar graph and k-probe-split graph

This page was built for publication: Block-Graph Width

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3630199)