Works matching IS 09635483 AND DT 2002 AND VI 11 AND IP 1
Results: 4
On the Circuit Cover Problem for Mixed Graphs.
- Published in:
- Combinatorics, Probability & Computing, 2002, v. 11, n. 1, p. 43, doi. 10.1017/S0963548301004989
- By:
- Publication type:
- Article
The Chromatic Number of Graph Powers.
- Published in:
- Combinatorics, Probability & Computing, 2002, v. 11, n. 1, p. 1, doi. 10.1017/S0963548301004965
- By:
- Publication type:
- Article
A Note on Vertex-Disjoint Cycles.
- Published in:
- Combinatorics, Probability & Computing, 2002, v. 11, n. 1, p. 97, doi. 10.1017/S0963548301004904
- By:
- Publication type:
- Article
A General Upper Bound on the List Chromatic Number of Locally Sparse Graphs.
- Published in:
- Combinatorics, Probability & Computing, 2002, v. 11, n. 1, p. 103, doi. 10.1017/S0963548301004898
- By:
- Publication type:
- Article