Keyphrases
B-coloring
40%
Bounded Degree
72%
Capacitated
18%
Chordal Graph
62%
Clique-width
36%
Colour Classes
18%
Diametral Path
36%
Disjoint Edges
18%
Disjoint Union
18%
Dominating Set
36%
Edge Contraction
36%
Feedback Vertex Set
18%
Graph Classes
30%
Graph Square Root
36%
Hedge Cost
18%
Hedging
36%
Isolated Vertex
18%
Linear Clique-width
18%
Linear Mim-width
18%
Linear Structure
36%
Matching number
72%
MaxCut
18%
Maximum Degree
36%
Maximum Matching
18%
Maximum number of Edges
72%
Min-cut
36%
Minimum Cost
18%
Multigraph
18%
Natural Places
18%
Number of Edges
18%
Odd Cycle Transversal
18%
Parameterized Problems
36%
Path Graph
36%
Path Length
18%
Planar Graph
36%
Polynomial Bounds
36%
Polynomial Time
25%
Polynomial-time Algorithm
16%
Quasi-polynomial
36%
Rainbow
36%
Rainbow Vertex Coloring
36%
Semitotal Domination number
36%
Small Distance
36%
Split Graphs
13%
Square Root
36%
Square Root Problem
18%
Tight
48%
Well-partitioned Chordal Graph
36%
Width Measures
18%
XP Algorithm
18%
Mathematics
Clique
39%
Clique-width
54%
Combinatorics
9%
Dominating Set
36%
Edge
100%
Exponential Time
9%
Independent Set
27%
Induced Subgraph
45%
Intersects
9%
Isolated Vertex
9%
Linear Structure
36%
Longest Path
9%
Max-Cut
18%
Maximum Degree
9%
Open Question
9%
Polynomial Time
54%
Running Time
9%
Square Root
36%
Transversals
18%
Upper Bound
12%
