标题
b-Coloring Parameterized by Clique-Width
作者
关键词
-
出版物
THEORY OF COMPUTING SYSTEMS
Volume -, Issue -, Pages -
出版商
Springer Science and Business Media LLC
发表日期
2023-09-23
DOI
10.1007/s00224-023-10132-0
参考文献
相关参考文献
注意:仅列出部分参考文献,下载原文获取全部文献信息。- A complexity dichotomy for critical values of the b-chromatic number of graphs
- (2020) Lars Jaffke et al. THEORETICAL COMPUTER SCIENCE
- Fully Polynomial FPT Algorithms for Some Classes of Bounded Clique-width Graphs
- (2019) David Coudert et al. ACM Transactions on Algorithms
- Slightly Superexponential Parameterized Problems
- (2018) Daniel Lokshtanov et al. SIAM JOURNAL ON COMPUTING
- Graphs with small fall-spectrum
- (2018) Ana Silva DISCRETE APPLIED MATHEMATICS
- Clique-width III
- (2018) Fedor V. Fomin et al. ACM Transactions on Algorithms
- On the parameterized complexity of b-chromatic number
- (2017) Fahad Panolan et al. JOURNAL OF COMPUTER AND SYSTEM SCIENCES
- Edge-b-Coloring Trees
- (2016) Victor Campos et al. ALGORITHMICA
- A characterization of b-chromatic and partial Grundy numbers by induced subgraphs
- (2016) Brice Effantin et al. DISCRETE MATHEMATICS
- The Behavior of Clique-Width under Graph Operations and Graph Transformations
- (2016) Frank Gurski THEORY OF COMPUTING SYSTEMS
- The b-chromatic index of graphs
- (2015) Victor A. Campos et al. DISCRETE MATHEMATICS
- Graphs of girth at least 7 have high b-chromatic number
- (2015) V. Campos et al. EUROPEAN JOURNAL OF COMBINATORICS
- $$b$$ b -Coloring is NP-hard on Co-bipartite Graphs and Polytime Solvable on Tree-Cographs
- (2014) Flavia Bonomo et al. ALGORITHMICA
- Maximization coloring problems on graphs with few P4
- (2013) Victor Campos et al. DISCRETE APPLIED MATHEMATICS
- Independent domination in graphs: A survey and recent results
- (2013) Wayne Goddard et al. DISCRETE MATHEMATICS
- Fast dynamic programming for locally checkable vertex subset and vertex partitioning problems
- (2013) Binh-Minh Bui-Xuan et al. THEORETICAL COMPUTER SCIENCE
- On the Grundy and b-Chromatic Numbers of a Graph
- (2011) Frédéric Havet et al. ALGORITHMICA
- b-coloring of tight graphs
- (2011) Frédéric Havet et al. DISCRETE APPLIED MATHEMATICS
- On the b-coloring of P4-tidy graphs
- (2010) Clara Inés Betancur Velasquez et al. DISCRETE APPLIED MATHEMATICS
- Intractability of Clique-Width Parameterizations
- (2010) Fedor V. Fomin et al. SIAM JOURNAL ON COMPUTING
- Improved upper bounds for vertex cover
- (2010) Jianer Chen et al. THEORETICAL COMPUTER SCIENCE
- On the b-Coloring of Cographs and P 4-Sparse Graphs
- (2009) Flavia Bonomo et al. GRAPHS AND COMBINATORICS
- Fall colouring of bipartite graphs and cartesian products of graphs
- (2008) Renu Laskar et al. DISCRETE APPLIED MATHEMATICS
- Clique-width of graphs defined by one-vertex extensions
- (2008) Michaël Rao DISCRETE MATHEMATICS
Find the ideal target journal for your manuscript
Explore over 38,000 international journals covering a vast array of academic fields.
SearchBecome a Peeref-certified reviewer
The Peeref Institute provides free reviewer training that teaches the core competencies of the academic peer review process.
Get Started