The SCEAS System
Navigation Menu
Introduction
Collection Based
Clustering
Ranking
Paper Based
Journals
Conferences
DB Status
Statistics
Search

Search the dblp DataBase

Title:
Author:
Douglas R. Woodall: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Alexandr V. Kostochka, Douglas R. Woodall
    Density Conditions for Panchromatic Colourings of Hypergraphs. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 2001, v:21, n:4, pp:515-541 [Journal]
  2. John D. Lamb, Gregory M. Asher, Douglas R. Woodall
    Bond Graphs III: Bond Graphs and Electrical Networks. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1997, v:73, n:3, pp:211-250 [Journal]
  3. John D. Lamb, Douglas R. Woodall, Gregory M. Asher
    Bond Graphs I: Acausal Equivalence. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1997, v:72, n:3, pp:261-293 [Journal]
  4. John D. Lamb, Douglas R. Woodall, Gregory M. Asher
    Bond Graphs II: Causality and Singularity. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1997, v:73, n:2, pp:143-173 [Journal]
  5. Douglas R. Woodall
    Monotonicity of Single-seat Preferential Election Rules. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1997, v:77, n:1, pp:81-98 [Journal]
  6. Alexandr V. Kostochka, Douglas R. Woodall
    Choosability conjectures and multicircuits. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2001, v:240, n:1-3, pp:123-143 [Journal]
  7. Alexandr V. Kostochka, Douglas R. Woodall
    Sparse sets in the complements of graphs with given girth. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2001, v:233, n:1-3, pp:163-174 [Journal]
  8. Dale Peterson, Douglas R. Woodall
    Erratum to "Edge-choosability in line-perfect multigraphs" [Discrete Mathematics 202 (1999) 191]. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2003, v:260, n:1-3, pp:323-326 [Journal]
  9. Andrew M. Robertshaw, Douglas R. Woodall
    Binding number conditions for matching extension. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2002, v:248, n:1-3, pp:169-179 [Journal]
  10. Douglas R. Woodall
    Preface. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2001, v:231, n:1-3, pp:1-2 [Journal]
  11. Douglas R. Woodall
    Defective choosability results for outerplanar and related graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2002, v:258, n:1-3, pp:215-223 [Journal]
  12. Douglas R. Woodall
    Tutte polynomial expansions for 2-separable graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2002, v:247, n:1-3, pp:201-213 [Journal]
  13. Douglas R. Woodall
    Preface. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2003, v:266, n:1-3, pp:1-2 [Journal]
  14. Douglas R. Woodall
    Preface. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2005, v:293, n:1-3, pp:1-0 [Journal]
  15. Oleg V. Borodin, Alexandr V. Kostochka, Douglas R. Woodall
    Total Colourings of Planar Graphs with Large Girth. [Citation Graph (0, 0)][DBLP]
    Eur. J. Comb., 1998, v:19, n:1, pp:19-24 [Journal]
  16. Alexandr V. Kostochka, Douglas R. Woodall
    On the Number of Edges in Hypergraphs Critical with Respect to Strong Colourings. [Citation Graph (0, 0)][DBLP]
    Eur. J. Comb., 2000, v:21, n:2, pp:249-255 [Journal]
  17. Alexandr V. Kostochka, Douglas R. Woodall
    Irreducible hypergraphs for Hall-type conditions, and arc-minimal digraph expanders. [Citation Graph (0, 0)][DBLP]
    Eur. J. Comb., 2005, v:26, n:7, pp:1119-1138 [Journal]
  18. Anton Prowse, Douglas R. Woodall
    Choosability of Powers of Circuits. [Citation Graph (0, 0)][DBLP]
    Graphs and Combinatorics, 2003, v:19, n:1, pp:137-144 [Journal]
  19. Oleg V. Borodin, Alexandr V. Kostochka, Douglas R. Woodall
    List Edge and List Total Colourings of Multigraphs. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1997, v:71, n:2, pp:184-204 [Journal]
  20. Andrew M. Robertshaw, Douglas R. Woodall
    Triangles and Neighbourhoods of Independent Sets in Graphs. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 2000, v:80, n:1, pp:122-129 [Journal]
  21. Douglas R. Woodall
    Distances Realized by Sets Covering the Plane. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 1973, v:14, n:2, pp:187-200 [Journal]
  22. Douglas R. Woodall
    Vector transversals. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1982, v:32, n:2, pp:189-205 [Journal]
  23. Douglas R. Woodall
    Some notes on feinberg's k-independence problem. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1982, v:32, n:3, pp:350-352 [Journal]
  24. Douglas R. Woodall
    A note on the cake-division problem. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 1986, v:42, n:2, pp:300-301 [Journal]
  25. Douglas R. Woodall
    A Note on Fisher's Inequality. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 1997, v:77, n:1, pp:171-176 [Journal]
  26. Béla Bollobás, D. L. Goldsmith, Douglas R. Woodall
    Indestructive deletions of edges from graphs. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1981, v:30, n:3, pp:263-275 [Journal]
  27. Douglas R. Woodall
    A sufficient condition for hamiltonian circuits. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1978, v:25, n:2, pp:184-186 [Journal]
  28. Douglas R. Woodall
    Circuits containing specified edges. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1977, v:22, n:3, pp:274-278 [Journal]
  29. Douglas R. Woodall
    A note on a problem of Halin's. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1976, v:21, n:2, pp:132-134 [Journal]
  30. Oleg V. Borodin, Douglas R. Woodall
    Cyclic Colorings of 3-Polytopes with Large Maximum Face Size. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 2002, v:15, n:2, pp:143-154 [Journal]
  31. Douglas R. Woodall
    Defective choosability of graphs with no edge-plus-independent-set minor. [Citation Graph (0, 0)][DBLP]
    Journal of Graph Theory, 2004, v:45, n:1, pp:51-56 [Journal]
  32. Douglas R. Woodall
    An impossibility theorem for electoral systems. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1987, v:66, n:1-2, pp:209-211 [Journal]
  33. Douglas R. Woodall
    Forbidden graphs for degree and neighbourhood conditions. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1989, v:75, n:1-3, pp:387-404 [Journal]
  34. Dale Peterson, Douglas R. Woodall
    Edge-choosability in line-perfect multigraphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1999, v:202, n:1-3, pp:191-199 [Journal]
  35. Douglas R. Woodall
    Edge-choosability of multicircuits. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1999, v:202, n:1-3, pp:271-277 [Journal]
  36. Dmitry Fon-Der-Flaass, Alexandr V. Kostochka, Douglas R. Woodall
    Transversals in uniform hypergraphs with property (7, 2). [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1999, v:207, n:1-3, pp:277-284 [Journal]
  37. Oleg V. Borodin, Alexandr V. Kostochka, Douglas R. Woodall
    On kernel-perfect orientations of line graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1998, v:191, n:1-3, pp:45-49 [Journal]
  38. Douglas R. Woodall
    The largest real zero of the chromatic polynomial. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1997, v:172, n:1-3, pp:141-153 [Journal]
  39. Douglas R. Woodall
    Preface. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1997, v:167, n:, pp:1-2 [Journal]
  40. Douglas R. Woodall
    A proof of McKee's eulerian-bipartite characterization. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1990, v:84, n:2, pp:217-220 [Journal]
  41. Douglas R. Woodall
    A zero-free interval for chromatic polynomials. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1992, v:101, n:1-3, pp:333-341 [Journal]
  42. Douglas R. Woodall
    An inequality for chromatic polynomials. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1992, v:101, n:1-3, pp:327-331 [Journal]
  43. Douglas R. Woodall
    Local and global proportionality. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1992, v:102, n:3, pp:315-328 [Journal]
  44. Douglas R. Woodall
    Cycle lengths and circuit matroids of graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1992, v:105, n:1-3, pp:269-273 [Journal]
  45. Douglas R. Woodall
    An identity involving 3-regular graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1996, v:152, n:1-3, pp:287-293 [Journal]
  46. Douglas R. Woodall
    Preface. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1995, v:138, n:1-3, pp:1-3 [Journal]

  47. Edge and Total Choosability of Near-Outerplanar Graphs. [Citation Graph (, )][DBLP]


  48. Total 4-Choosability of Series-Parallel Graphs. [Citation Graph (, )][DBLP]


  49. The average degree of an edge-chromatic critical graph. [Citation Graph (, )][DBLP]


  50. List-colouring the square of a K4-minor-free graph. [Citation Graph (, )][DBLP]


  51. A Brooks-type bound for squares of K4-minor-free graphs. [Citation Graph (, )][DBLP]


  52. The average degree of a multigraph critical with respect to edge or total choosability. [Citation Graph (, )][DBLP]


Search in 0.020secs, Finished in 0.022secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
Introduction Collection Based Clustering Ranking Paper Based Journals Conferences DB Status Statistics Search
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002