X
Search Filters
Format Format
Subjects Subjects
Subjects Subjects
X
Sort by Item Count (A-Z)
Filter by Count
clique-width (252) 252
mathematics, applied (109) 109
computer science (105) 105
algorithms (102) 102
graphs (82) 82
mathematics (77) 77
computer science, theory & methods (75) 75
tree-width (53) 53
complexity (51) 51
rank-width (44) 44
discrete mathematics and combinatorics (33) 33
theoretical computer science (30) 30
minors (27) 27
monadic second-order logic (27) 27
computer science, software engineering (26) 26
discrete mathematics (26) 26
treewidth (26) 26
applied mathematics (25) 25
logic (24) 24
mathematics - combinatorics (24) 24
theory of computation (24) 24
branch-width (22) 22
logic in computer science (22) 22
monadic 2nd-order logic (22) 22
nlc-width (22) 22
graph theory (21) 21
recognition (21) 21
algorithm (20) 20
algorithm analysis and problem complexity (20) 20
computational complexity (20) 20
computer science - discrete mathematics (20) 20
modular decomposition (20) 20
parameterized complexity (20) 20
data structures and algorithms (19) 19
decomposition (19) 19
bounded clique-width (17) 17
graph minors (17) 17
computer science - data structures and algorithms (15) 15
graph algorithms (15) 15
optimization (14) 14
trees (14) 14
[info.info-lo]computer science [cs]/logic in computer science [cs.lo] (13) 13
bipartite graphs (13) 13
computer science, hardware & architecture (13) 13
computer science, information systems (13) 13
forbidden induced subgraph (13) 13
mathematics of computing (13) 13
-free graphs (12) 12
[info.info-ds]computer science [cs]/data structures and algorithms [cs.ds] (12) 12
computational theory and mathematics (12) 12
computer systems organization and communication networks (12) 12
data structures, cryptology and information theory (12) 12
mathematical analysis (12) 12
sets (12) 12
[info.info-dm]computer science [cs]/discrete mathematics [cs.dm] (11) 11
analysis (11) 11
combinatorics (11) 11
set (11) 11
triangle-free graphs (11) 11
coloring (10) 10
computation (10) 10
linear clique-width (10) 10
pathwidth (10) 10
prime graphs (10) 10
split decomposition (10) 10
[ info.info-dm ] computer science [cs]/discrete mathematics [cs.dm] (9) 9
forbidden induced subgraphs (9) 9
forbidden subgraphs (9) 9
hereditary graph class (9) 9
np-completeness (9) 9
obstructions (9) 9
polynomial-time algorithm (9) 9
vertex-minor (9) 9
co-gem-free (8) 8
cographs (8) 8
combinatorial analysis (8) 8
computer science - logic in computer science (8) 8
discrete mathematics in computer science (8) 8
distance-hereditary graphs (8) 8
dynamic programming (8) 8
graph decomposition (8) 8
mathematical models (8) 8
matroids (8) 8
polynomials (8) 8
time (8) 8
[ info.info-ds ] computer science [cs]/data structures and algorithms [cs.ds] (7) 7
[ info.info-lo ] computer science [cs]/logic in computer science [cs.lo] (7) 7
[info.info-cc]computer science [cs]/computational complexity [cs.cc] (7) 7
clique width (7) 7
decompositions (7) 7
graph (7) 7
graph class (7) 7
graph coloring (7) 7
hereditary classes (7) 7
linear-time (7) 7
number (7) 7
studies (7) 7
vertex-minors (7) 7
clique width of graphs (6) 6
dominating set (6) 6
more...
Language Language
Publication Date Publication Date
Click on a bar to filter by decade
Slide to change publication date range


Journal of Graph Theory, ISSN 0364-9024, 04/2017, Volume 84, Issue 4, pp. 501 - 511
The class of cographs is known to have unbounded linear clique‐width. We prove that a hereditary class of cographs has bounded linear clique‐width if and only... 
linear clique‐width | threshold graphs | quasi‐threshold graphs | clique‐width | cographs | clique-width | quasi-threshold graphs | linear clique-width | MATHEMATICS | NLC-WIDTH | GRAPHS
Journal Article
Discrete Applied Mathematics, ISSN 0166-218X, 10/2018, Volume 248, pp. 145 - 152
The celebrated theorem of Robertson and Seymour states that in the family of minor-closed graph classes, there is a unique minimal class of graphs of unbounded... 
Hereditary class | Linear clique-width | Clique-width | MINORS | MATHEMATICS, APPLIED
Journal Article
Discrete Applied Mathematics, ISSN 0166-218X, 05/2015, Volume 187, pp. 70 - 81
Clique-width of graphs is defined algebraically through operations on graphs with vertex labels. We characterise the clique-width in a combinatorial way by... 
Efficient representation | Linear clique-width | Characterisation | Clique-width | MATHEMATICS, APPLIED | GRAPHS | Logic in Computer Science | Computer Science
Journal Article
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), ISSN 0302-9743, 2015, Volume 9079, pp. 167 - 181
Conference Proceeding
SIAM journal on computing, ISSN 1095-7111, 2008, Volume 38, Issue 3, pp. 1012 - 1032
We present a new algorithm that can output the rank-decomposition of width at most k of a graph if such exists. For that we use an algorithm that, for an input... 
Graph | Rank-width | Matroid | Fixed-parameter tractable algorithm | Branch-width | Clique-width | MATHEMATICS, APPLIED | branch-width | rank-width | RECOGNITION | fixed-parameter tractable algorithm | VERTEX-MINORS | ALGORITHMS | FIXED CLIQUE-WIDTH | graph | GRAPHS | clique-width | MATROIDS | MONADIC 2ND-ORDER LOGIC | COMPUTER SCIENCE, THEORY & METHODS | matroid
Journal Article
Journal of Computer and System Sciences, ISSN 0022-0000, 11/2017, Volume 89, pp. 410 - 431
The Colouring problem is that of deciding, given a graph G and an integer k, whether G admits a (proper) k-colouring. For all graphs H up to five vertices, we... 
Forbidden induced subgraph | Graph colouring | Diamond-free | Clique-width | COMPUTER SCIENCE, HARDWARE & ARCHITECTURE | CO-GEM-FREE | TRIANGLE-FREE GRAPHS | LINEAR-TIME | BOUNDED CLIQUE-WIDTH | COMPUTER SCIENCE, THEORY & METHODS | HEREDITARY CLASSES | FORBIDDEN SUBGRAPHS | BIPARTITE GRAPHS | Logic | Mathematics
Journal Article
ACM Transactions on Computational Logic (TOCL), ISSN 1529-3785, 07/2015, Volume 16, Issue 3, pp. 1 - 27
Clique-width is a graph invariant that has been widely studied in combinatorics and computational logic. Computing the clique-width of a graph is an intricate... 
k-expression | satisfiability | linear clique-width | SAT solver | SAT encoding | Clique-width | cardinality constraint | K-expression | Linear clique-width | Cardinality constraint | Satisfiability | Theory | LOGIC | GRAPHS | Algorithms | Experimentation | COMPUTER SCIENCE, THEORY & METHODS
Journal Article
Graphs and combinatorics, ISSN 1435-5914, 2019, Volume 36, Issue 1, pp. 125 - 138
A hole is a chordless cycle with at least four vertices. A hole is even if its number of vertices is even. Given a set L of graphs, a graph G is L-free if G... 
MATHEMATICS | CLIQUE-WIDTH | Graph coloring | Perfect graphs | GRAPHS | Coloring | Graphs | Graph theory | Apexes | Complexity
Journal Article
Journal of Computer and System Sciences, ISSN 0022-0000, 12/2019, Volume 106, pp. 60 - 79
The complexity of Colouring is fully understood for H-free graphs, but there are still major complexity gaps if two induced subgraphs H1 and H2 are forbidden.... 
Atoms | Graph colouring | Forbidden induced subgraphs | Clique-width | NP-COMPLETENESS | COMPUTER SCIENCE, HARDWARE & ARCHITECTURE | SET | COMPLEXITY | COMPUTER SCIENCE, THEORY & METHODS | Computer science | Hardness
Journal Article
Discrete Applied Mathematics, ISSN 0166-218X, 10/2018, Volume 248, pp. 68 - 78
We study the parameterized complexity of the classical Edge Hamiltonian Path  problem and give several fixed-parameter tractability results. First, we settle... 
Structural parameterization | Edge Hamiltonicity | Polynomial kernel | Fixed parameter tractability | EULERIAN SUBGRAPHS | MATHEMATICS, APPLIED | CLIQUE-WIDTH | OPTIMIZATION | PATH PROBLEM | GRAPHS | Computer Science
Journal Article
Journal of Combinatorial Theory, Series B, ISSN 0095-8956, 05/2018, Volume 130, pp. 1 - 18
Does well-quasi-ordering by induced subgraphs imply bounded clique-width for hereditary classes? This question was asked by Daligault, Rao, and Thomassé [7].... 
Well-quasi-ordering | Hereditary classes | Induced subgraphs | Clique-width | MATHEMATICS | GRAPH MINORS
Journal Article
Discrete Applied Mathematics, ISSN 0166-218X, 10/2020, Volume 285, pp. 688 - 690
We prove that (4K1,C4,C5,C7)-free graphs that are not chordal have unbounded clique-width. This disproves a conjecture from Fraser et al. (2017). 
Forbidden induced subgraphs | Clique-width
Journal Article
Discrete Applied Mathematics, ISSN 0166-218X, 10/2016, Volume 211, pp. 30 - 39
A graph is H-free if it has no induced subgraph isomorphic to  H. We continue a study into the boundedness of clique-width of subclasses of perfect graphs. We... 
Split graph | Forbidden induced subgraph | Hereditary graph class | Perfect graph | Clique-width | MATHEMATICS, APPLIED | CO-GEM-FREE | (P-5,GEM)-FREE GRAPHS | FORBIDDEN SUBGRAPHS | TRIANGLE-FREE GRAPHS | BIPARTITE GRAPHS
Journal Article
Discrete Applied Mathematics, ISSN 0166-218X, 01/2016, Volume 199, pp. 16 - 29
Bichain graphs form a bipartite analog of split permutation graphs, also known as split graphs of Dilworth number 2. Unlike graphs of Dilworth number 1 that... 
Split permutation graph | Intersection graph | Universal graph | MATHEMATICS, APPLIED | CLIQUE-WIDTH | SUBGRAPHS | SPLIT GRAPHS
Journal Article
Discrete Mathematics, ISSN 0012-365X, 01/2016, Volume 339, Issue 1, pp. 222 - 226
We determine the relationship between the graph parameters neighbourhood-width and path-width of trees, that turn out equivalent. As our main combinatorial... 
Neighbourhood-width | Trees | Path-width | MATHEMATICS | NUMBER | VERTEX SEPARATION | CLIQUE-WIDTH | GRAPH MINORS
Journal Article
Discrete Applied Mathematics, ISSN 0166-218X, 12/2015, Volume 197, pp. 53 - 58
We study the computational complexity of the minimum dominating set problem on graphs restricted by forbidden induced subgraphs. We give some dichotomies... 
Algorithms | Dominating set | Forbidden induced subgraphs | Complexity | MATHEMATICS, APPLIED | SETS | ALGORITHM | CHORDAL GRAPHS | CLIQUE-WIDTH | BIPARTITE GRAPHS
Journal Article
Algorithmica, ISSN 0178-4617, 07/2018, Volume 80, Issue 7, pp. 2160 - 2180
The problem MaxW-Light (MaxW-Heavy) for an undirected graph is to assign a direction to each edge so that the number of vertices of outdegree at most W (resp.... 
Computer Science(all) | Width parameter | Computer Science Applications | Graph class | Orientation | Applied Mathematics | Parameterized complexity | MATHEMATICS, APPLIED | TREEWIDTH | ALGORITHMS | LOGIC | COMPUTER SCIENCE, SOFTWARE ENGINEERING | CLIQUE-WIDTH | VERTICES | SUBGRAPHS | OUT-DEGREE | Computer science | Algorithms
Journal Article
Journal of the ACM (JACM), ISSN 0004-5411, 10/2012, Volume 59, Issue 5, pp. 1 - 64
Journal Article
ACM Transactions on Algorithms (TALG), ISSN 1549-6325, 07/2019, Volume 15, Issue 3, pp. 1 - 57
Journal Article
Discrete Applied Mathematics, ISSN 0166-218X, 04/2015, Volume 185, pp. 138 - 167
Bubble models are 2-dimensional representations of proper interval graphs. We consider proper interval graphs that have bubble models of specific properties.... 
Proper interval graphs | Characterisation | Forbidden induced subgraphs | Clique-width | Polynomial time | MATHEMATICS, APPLIED | Intervals | Graphs | Bubbles | Mathematical models | Representations
Journal Article
No results were found for your search.

Cannot display more than 1000 results, please narrow the terms of your search.