Keyphrases
Induced Subgraph
74%
Chromatic number
56%
Graph Minors
41%
Planar Graph
34%
Matroid
31%
Polynomial-time Algorithm
26%
Digraph
24%
Treewidth
20%
Stable Set
20%
Disjoint
18%
Pure Pair
18%
Hypergraph
17%
Clique number
16%
Claw-free Graph
15%
Induced Cycle
15%
Polynomial Bounds
14%
Bipartite Graph
13%
Hadwiger's Conjecture
13%
Cardinality
13%
Well-quasi-ordering
12%
Disjoint Paths
12%
Vertex-disjoint
12%
Complete Graph
12%
Vertex Set
12%
Directed Circuit
12%
Odd Hole
11%
Cubic Graph
10%
Graph Theory
9%
Petersen Graph
8%
In(III)
8%
Infinite Sets
8%
Path Graph
8%
Edge-disjoint
8%
Edge Coloring
8%
Graph Embedding
8%
Wagner Conjecture
8%
Clique Set
8%
Induced Path
8%
Path Length
7%
Polynomial Time
7%
Line Graph
7%
Maximum Degree
7%
Even-hole-free Graphs
7%
Linkless Embedding
7%
Third Space
7%
Branchwidth
7%
Directed Graph
7%
Multicommodity Flow
7%
Even Pair
7%
General Graphs
7%
Mathematics
Edge
100%
Induced Subgraph
72%
Free Graph
48%
Chromatic Number
44%
Planar Graph
42%
Clique
35%
Polynomial Time
31%
Polynomial
30%
Integer
25%
Cardinality
22%
Stable Set
21%
Bipartite Graph
20%
Hypergraphs
18%
clique number ω
16%
Complete Graph
13%
Counterexample
11%
Line Graph
11%
Robertson
10%
Infinite Set
9%
Finite Graph
8%
Maximum Degree
8%
Branch-width
8%
Vertex of a Graph
8%
Tree Structure
7%
Disjoint Set
7%
Spanning Tree
7%
Well-Quasi-Order
6%
Directed Path
6%
Pairwise Disjoint
6%
Triangle
6%
Connected Component
6%
Connected Graph
6%
Main Result
6%
Four Color Theorem
6%
Matrix (Mathematics)
6%
Min-Cut
5%
Path Problem
5%
Disjoint Subset
5%
