Computing Graph Polynomials on Graphs of Bounded Clique-Width
From MaRDI portal
Publication:3522957
DOI10.1007/11917496_18zbMath1167.05335OpenAlexW1524888420WikidataQ56504780 ScholiaQ56504780MaRDI QIDQ3522957
Benny Godlin, Ilya Averbouch, Johann A. Makowsky, Udi Rotics
Publication date: 4 September 2008
Published in: Graph-Theoretic Concepts in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/11917496_18
Analysis of algorithms and problem complexity (68Q25) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items (10)
Properties of chromatic polynomials of hypergraphs not held for chromatic polynomials of graphs ⋮ Harary polynomials ⋮ Hierarchical and modularly-minimal vertex colorings ⋮ A Most General Edge Elimination Polynomial ⋮ Unnamed Item ⋮ The enumeration of vertex induced subgraphs with respect to the number of components ⋮ Maximal Matching and Path Matching Counting in Polynomial Time for Graphs of Bounded Clique Width ⋮ A little statistical mechanics for the graph theorist ⋮ From a zoo to a zoology: Towards a general theory of graph polynomials ⋮ An extension of the bivariate chromatic polynomial
This page was built for publication: Computing Graph Polynomials on Graphs of Bounded Clique-Width
