- Home
- Publications
- Publication Search
- Publication Details
Title
Bounding the mim‐width of hereditary graph classes
Authors
Keywords
-
Journal
JOURNAL OF GRAPH THEORY
Volume -, Issue -, Pages -
Publisher
Wiley
Online
2021-08-25
DOI
10.1002/jgt.22730
References
Ask authors/readers for more resources
Related references
Note: Only part of the references are listed.- List k-colouring P-free graphs: A Mim-width perspective
- (2021) Nick Brettell et al. INFORMATION PROCESSING LETTERS
- Semitotal Domination: New hardness results and a polynomial-time algorithm for graphs of bounded mim-width
- (2020) Esther Galby et al. THEORETICAL COMPUTER SCIENCE
- On the Tractability of Optimization Problems on H-Graphs
- (2020) Fedor V. Fomin et al. ALGORITHMICA
- Mim-Width II. The Feedback Vertex Set Problem
- (2019) Lars Jaffke et al. ALGORITHMICA
- Mim-Width I. Induced path problems
- (2019) Lars Jaffke et al. DISCRETE APPLIED MATHEMATICS
- Clique-width and well-quasi-ordering of triangle-free graph classes
- (2019) Konrad K. Dabrowski et al. JOURNAL OF COMPUTER AND SYSTEM SCIENCES
- Mim-width III. Graph powers and generalized distance domination problems
- (2019) Lars Jaffke et al. THEORETICAL COMPUTER SCIENCE
- Colouring diamond-free graphs
- (2017) Konrad K. Dabrowski et al. JOURNAL OF COMPUTER AND SYSTEM SCIENCES
- A width parameter useful for chordal and co-comparability graphs
- (2017) Dong Yeap Kang et al. THEORETICAL COMPUTER SCIENCE
- Lower bounds on the mim-width of some graph classes
- (2017) Stefan Mengel DISCRETE APPLIED MATHEMATICS
- Bounding clique-width via perfect graphs
- (2016) Konrad K. Dabrowski et al. JOURNAL OF COMPUTER AND SYSTEM SCIENCES
- Hardness of computing width parameters based on branch decompositions over the vertex set
- (2016) Sigve Hortemo Sæther et al. THEORETICAL COMPUTER SCIENCE
- The Behavior of Clique-Width under Graph Operations and Graph Transformations
- (2016) Frank Gurski THEORY OF COMPUTING SYSTEMS
- Clique-Width of Graph Classes Defined by Two Forbidden Induced Subgraphs
- (2015) Konrad K. Dabrowski et al. COMPUTER JOURNAL
- List Coloring in the Absence of a Linear Forest
- (2013) Jean-François Couturier et al. ALGORITHMICA
- Fast dynamic programming for locally checkable vertex subset and vertex partitioning problems
- (2013) Binh-Minh Bui-Xuan et al. THEORETICAL COMPUTER SCIENCE
- Graph classes with structured neighborhoods and algorithmic applications
- (2013) Rémy Belmonte et al. THEORETICAL COMPUTER SCIENCE
- Colouring vertices of triangle-free graphs without forests
- (2012) Konrad K. Dabrowski et al. DISCRETE MATHEMATICS
- Boolean-width of graphs
- (2011) Binh-Minh Bui-Xuan et al. THEORETICAL COMPUTER SCIENCE
- On the induced matching problem
- (2010) Iyad Kanj et al. JOURNAL OF COMPUTER AND SYSTEM SCIENCES
- Recent developments on graphs of bounded clique-width
- (2008) Marcin Kamiński et al. DISCRETE APPLIED MATHEMATICS
- Clique-width of graphs defined by one-vertex extensions
- (2008) Michaël Rao DISCRETE MATHEMATICS
Find Funding. Review Successful Grants.
Explore over 25,000 new funding opportunities and over 6,000,000 successful grants.
ExploreAdd your recorded webinar
Do you already have a recorded webinar? Grow your audience and get more views by easily listing your recording on Peeref.
Upload Now