On graphs with subgraphs having large independence numbers.
- Published in:
- Journal of Graph Theory, 2007, v. 56, n. 2, p. 149
- By:
- Publication type:
- Article
Works matching IS 03649024 AND DT 2007 AND VI 56 AND IP 2
Results: 6
1
2
Maximum number of colorings of (2k, k2)‐graphs.
- Published in:
- Journal of Graph Theory, 2007, v. 56, n. 2, p. 135
- By:
- Publication type:
- Article
3
Cross‐intersecting couples of graphs.
- Published in:
- Journal of Graph Theory, 2007, v. 56, n. 2, p. 105
- By:
- Publication type:
- Article
4
On the independence number of the Erdős‐Rényi and projective norm graphs and a related hypergraph.
- Published in:
- Journal of Graph Theory, 2007, v. 56, n. 2, p. 113
- By:
- Publication type:
- Article
5
The crossing number of K11 is 100.
- Published in:
- Journal of Graph Theory, 2007, v. 56, n. 2, p. 128
- By:
- Publication type:
- Article
6
On the chromatic spectrum of acyclic decompositions of graphs.
- Published in:
- Journal of Graph Theory, 2007, v. 56, n. 2, p. 83
- By:
- Publication type:
- Article