scientific article; zbMATH DE number 1420904
From MaRDI portal
Publication:4944973
Recommendations
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
- Collective tree spanners in graphs with bounded parameters
- The maximum weight stable set problem in (\(P_6\), bull)-free graphs
- Stability, vertex stability, and unfrozenness for special graph classes
- Computing the clique-width of cactus graphs
- Twin-distance-hereditary digraphs
- 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)
- scientific article; zbMATH DE number 2191997 (Why is no real title available?)
- 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)
