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