Circular chromatic index of graphs of maximum degree 3.
- Published in:
- Journal of Graph Theory, 2005, v. 49, n. 4, p. 325
- By:
- Publication type:
- Article
Works matching IS 03649024 AND DT 2005 AND VI 49 AND IP 4
Results: 8
1
2
NP-completeness of list coloring and precoloring extension on the edges of planar graphs.
- Published in:
- Journal of Graph Theory, 2005, v. 49, n. 4, p. 313
- By:
- Publication type:
- Article
3
Characterizing subgraphs of Hamming graphs.
- Published in:
- Journal of Graph Theory, 2005, v. 49, n. 4, p. 302
- By:
- Publication type:
- Article
4
The Erdos-Ss Conjecture for trees of diameter four.
- Published in:
- Journal of Graph Theory, 2005, v. 49, n. 4, p. 291
- By:
- Publication type:
- Article
5
A linear Vizing-like relation relating the size and total domination number of a graph.
- Published in:
- Journal of Graph Theory, 2005, v. 49, n. 4, p. 285
- By:
- Publication type:
- Article
6
Posets and planar graphs.
- Published in:
- Journal of Graph Theory, 2005, v. 49, n. 4, p. 273
- By:
- Publication type:
- Article
7
Hamiltonicity and forbidden subgraphs in 4-connected graphs.
- Published in:
- Journal of Graph Theory, 2005, v. 49, n. 4, p. 262
- By:
- Publication type:
- Article
8
A topological lower bound for the circular chromatic number of Schrijver graphs.
- Published in:
- Journal of Graph Theory, 2005, v. 49, n. 4, p. 257
- By:
- Publication type:
- Article