Works matching IS 03649024 AND DT 2009 AND VI 61 AND IP 4
Results: 5
Planar graphs without 4-cycles are acyclically 6-choosable.
- Published in:
- Journal of Graph Theory, 2009, v. 61, n. 4, p. 307, doi. 10.1002/jgt.20381
- By:
- Publication type:
- Article
Circular choosability.
- Published in:
- Journal of Graph Theory, 2009, v. 61, n. 4, p. 241, doi. 10.1002/jgt.20375
- By:
- Publication type:
- Article
Partial characterizations of circular-arc graphs.
- Published in:
- Journal of Graph Theory, 2009, v. 61, n. 4, p. 289, doi. 10.1002/jgt.20379
- By:
- Publication type:
- Article
On bipartite graphs of diameter 3 and defect 2.
- Published in:
- Journal of Graph Theory, 2009, v. 61, n. 4, p. 271, doi. 10.1002/jgt.20378
- By:
- Publication type:
- Article
Complete triangulations of a given order generated from a multitude of nonisomorphic cubic graphs by current assignments.
- Published in:
- Journal of Graph Theory, 2009, v. 61, n. 4, p. 324, doi. 10.1002/jgt.20430
- By:
- Publication type:
- Article