Complexity of clique-coloring odd-hole-free graphs.
- Published in:
- Journal of Graph Theory, 2009, v. 62, n. 2, p. 139, doi. 10.1002/jgt.20387
- By:
- Publication type:
- Article
Works matching IS 03649024 AND DT 2009 AND VI 62 AND IP 2
Results: 7
1
2
Erratum to: 'The falsity of the reconstruction conjecture for tournaments'.
- Published in:
- Journal of Graph Theory, 2009, v. 62, n. 2, p. 199, doi. 10.1002/jgt.20398
- By:
- Publication type:
- Article
3
Edge disjoint Steiner trees in graphs without large bridges.
- Published in:
- Journal of Graph Theory, 2009, v. 62, n. 2, p. 188, doi. 10.1002/jgt.20389
- By:
- Publication type:
- Article
4
Adapted list coloring of planar graphs.
- Published in:
- Journal of Graph Theory, 2009, v. 62, n. 2, p. 127, doi. 10.1002/jgt.20391
- By:
- Publication type:
- Article
5
Packing two copies of a sparse graph into a graph with restrained maximum degree.
- Published in:
- Journal of Graph Theory, 2009, v. 62, n. 2, p. 178, doi. 10.1002/jgt.20384
- By:
- Publication type:
- Article
6
Average distance and vertex-connectivity.
- Published in:
- Journal of Graph Theory, 2009, v. 62, n. 2, p. 157, doi. 10.1002/jgt.20395
- By:
- Publication type:
- Article
7
The complexity of the matching-cut problem for planar graphs and other graph classes.
- Published in:
- Journal of Graph Theory, 2009, v. 62, n. 2, p. 109, doi. 10.1002/jgt.20390
- By:
- Publication type:
- Article