Intersection number (graph theory)

Known as: Clique edge cover, Intersection graph basis 
In the mathematical field of graph theory, the intersection number of a graph G = (V,E) is the smallest number of elements in a representation of G… (More)
Wikipedia

Topic mentions per year

Topic mentions per year

1978-2016
02419782016

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2014
2014
Let H,K be subgroups of G. We investigate the intersection properties of left and right cosets of these subgroups. If H and K are… (More)
Is this relevant?
2011
2011
A typical first step of a direct solver for the linear system Mx = b is reordering of the symmetric matrix M to improve execution… (More)
  • figure 2.1
  • figure 3.1
  • figure 3.2
  • figure 3.3
  • figure 3.4
Is this relevant?
2010
2010
In recent years, the theory of group representations has greatly benefited from a new approach provided by the topology of… (More)
Is this relevant?
2007
2007
A graph class has few cliques if there is a polynomial bound on the number of maximal cliques contained in any member of the… (More)
  • table 1
Is this relevant?
2007
2007
We consider the class of L-convex polyominoes, i.e. those polyominoes in which any two cells can be connected with an “L” shaped… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2005
2005
Let ⊢ be a rank-2 intersection type system. We say that a term is ⊢-simple (or just simple when the system ⊢ is clear from the… (More)
  • figure 1
  • figure 2
  • figure 3
Is this relevant?
1998
1998
K. F. Fraughnaugh et al. proved that a graph G is the competition graph of a hamiltonian digraph possibly having loops if and… (More)
Is this relevant?
1990
1990
Assume that G = G(V, E) is an undirected graph with vertex set V and edge set E. A clique of G is a complete subgraph. An edge… (More)
Is this relevant?
1980
1980
In this paper we examine 2-designs having an intersection number k n. This intersection number gives rise to an equivalence… (More)
Is this relevant?
Highly Cited
1978
Highly Cited
1978
Kellerman has presented a method for determining keyword conflicts and described a heuristic algorithm which solves a certain… (More)
  • figure 2
Is this relevant?