Skip to main navigation
Skip to search
Skip to main content
Sort by
Keyphrases
Digraph
98%
Hypergraph
59%
Transversal
48%
Total Domination number
28%
Total Domination
28%
Transversal number
23%
Uniform Hypergraph
22%
Maximum Degree
22%
Minimum Degree
20%
Linear Hypergraph
19%
Number of Vertices
18%
Polynomial Time
18%
Total Dominating Set
18%
Semicomplete Digraph
17%
Fixed-parameter Tractability
17%
Minimum Cardinality
16%
Connected Graph
16%
Subdigraph
16%
Minimum Cost Homomorphisms
15%
Out-branching
14%
NP-complete
14%
Polynomial-time Algorithm
13%
Semicomplete multipartite Digraph
13%
Tight Lower Bound
13%
Minimum number
13%
Domination in Graphs
13%
Matching number
12%
Graph Theory
12%
NP-hard
12%
Critical Graph
12%
Out-degree
11%
Diameter-2-critical
10%
Oriented Graph
10%
In-degree
10%
Directed Graph
10%
Homomorphism
10%
Parameterized Complexity
10%
Number of Edges
9%
3-uniform Hypergraph
9%
Arc-disjoint
9%
Undirected Graph
9%
In(III)
8%
Hamilton Cycle
8%
K-uniform Hypergraph
8%
Domination number of Graphs
8%
Acyclic Digraph
8%
Homomorphism Problem
7%
Diameter Two
7%
Strong Digraph
7%
General Digraphs
7%
Mathematics
Edge
100%
Hypergraphs
85%
Transversals
58%
domination number γ
36%
Polynomial
35%
Polynomial Time
34%
Cardinality
30%
Dominating Set
28%
Maximum Degree
22%
Upper Bound
20%
Open Problem
18%
Integer
18%
Critical Graph
17%
Homomorphism
17%
Connected Graph
16%
Bipartite Graph
15%
Hamiltonian Cycle
11%
Oriented Graph
11%
Acyclic Digraph
11%
Main Result
11%
Distinct Vertex
10%
Running Time
10%
Permutation
9%
Independent Set
8%
Hamiltonian Path
8%
Directed Path
8%
Sufficient Condition
7%
Exponential Time
7%
Convex Set
7%
Independence Number
7%
Open Question
7%
Free Graph
7%
Positive Integer
6%
Intersects
6%
Finite Number
6%
Stable Matching
6%
Regular Graph
6%
Triangle
6%
Opposite Arc
6%
Nonnegative Integer
5%
Multigraph
5%
Edge-Connectivity
5%
Extremal Graph
5%
