scientific article; zbMATH DE number 1420904
From MaRDI portal
Publication:4944973
zbMATH Open0941.05047MaRDI QIDQ4944973FDOQ4944973
Authors: Martin Charles Golumbic, Udi Rotics 
Publication date: 22 May 2000
Title of this publication is not available (Why is that?)
Recommendations
Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Perfect graphs (05C17)
Cited In (21)
- Graph classes with structured neighborhoods and algorithmic applications
- Solutions for the knapsack problem with conflict and forcing graphs of bounded clique-width
- Partial characterizations of clique-perfect and coordinated graphs: superclasses of triangle-free graphs
- Stability, vertex stability, and unfrozenness for special graph classes
- The maximum weight stable set problem in (\(P_6\), bull)-free graphs
- Collective tree spanners in graphs with bounded parameters
- Twin-distance-hereditary digraphs
- Computing the clique-width of cactus graphs
- Labelled packing functions in graphs
- From Tree-Width to Clique-Width: Excluding a Unit Interval Graph
- On the clique-width of graph with few \(P_{4}\)'s
- Clique-width and well-quasi-ordering of triangle-free graph classes
- On the clique-width of some perfect graph classes
- Complexity of \(k\)-tuple total and total \(\{k\}\)-dominations for some subclasses of bipartite graphs
- On the complexity of the labeled domination problem in graphs
- On \(d\)-stable locally checkable problems parameterized by mim-width
- New plain-exponential time classes for graph homomorphism
- Computing a metric basis of a bipartite distance-hereditary graph
- On the Expressive Power of Permanents and Perfect Matchings of Matrices of Bounded Pathwidth/Cliquewidth (Extended Abstract)
- Title not available (Why is that?)
- Computing maximum stable sets for distance-hereditary graphs
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4944973)
