Critical properties of graphs of bounded clique-width
From MaRDI portal
Publication:1947013
DOI10.1016/j.disc.2013.01.008zbMath1262.05120OpenAlexW1968740197MaRDI QIDQ1947013
Martin Milanič, Vadim V. Lozin
Publication date: 11 April 2013
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2013.01.008
Extremal problems in graph theory (05C35) Graph theory (including graph drawing) in computer science (68R10) Structural characterization of families of graphs (05C75) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Related Items (6)
The computational complexity of dominating set problems for instances with bounded minors of constraint matrices ⋮ Graph classes with and without powers of bounded clique-width ⋮ Upper domination: towards a dichotomy through boundary properties ⋮ Critical properties and complexity measures of read-once Boolean functions ⋮ A Boundary Property for Upper Domination ⋮ The computational complexity of three graph problems for instances with bounded minors of constraint matrices
This page was built for publication: Critical properties of graphs of bounded clique-width
