Distinguishing Cartesian powers of graphs.
- Published in:
- Journal of Graph Theory, 2006, v. 53, n. 3, p. 250
- By:
- Publication type:
- Article
Works matching IS 03649024 AND DT 2006 AND VI 53 AND IP 3
Results: 5
1
2
A Ramsey‐type result for the hypercube.
- Published in:
- Journal of Graph Theory, 2006, v. 53, n. 3, p. 196
- By:
- Publication type:
- Article
3
Transversal hypergraphs to perfect matchings in bipartite graphs: Characterization and generation algorithms.
- Published in:
- Journal of Graph Theory, 2006, v. 53, n. 3, p. 209
- By:
- Publication type:
- Article
4
Clique‐coloring some classes of odd‐hole‐free graphs.
- Published in:
- Journal of Graph Theory, 2006, v. 53, n. 3, p. 233
- By:
- Publication type:
- Article
5
Infinite paths in planar graphs IV, dividing cycles.
- Published in:
- Journal of Graph Theory, 2006, v. 53, n. 3, p. 173
- By:
- Publication type:
- Article