Douglas B. West

According to our database1, Douglas B. West authored at least 203 papers between 1979 and 2019.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of one.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2019
Reconstruction from the deck of -vertex induced subgraphs.
Journal of Graph Theory, 2019

Ramsey Numbers of Interval 2-Chromatic Ordered Graphs.
Graphs and Combinatorics, 2019

Largest 2-Regular Subgraphs in 3-Regular Graphs.
Graphs and Combinatorics, 2019

Extensions of matroid covering and packing.
Eur. J. Comb., 2019

Antipodal edge-colorings of hypercubes.
Discussiones Mathematicae Graph Theory, 2019

Online sum-paintability: Slow-coloring of trees.
Discrete Applied Mathematics, 2019

Extremal problems on saturation for the family of k-edge-connected graphs.
Discrete Applied Mathematics, 2019

The unit acquisition number of a graph.
Discrete Applied Mathematics, 2019

2018
Fractional and circular separation dimension of graphs.
Eur. J. Comb., 2018

Randomly twisted hypercubes.
Eur. J. Comb., 2018

Online sum-paintability: The slow-coloring game.
Discrete Mathematics, 2018

2017
The vulnerability of the diameter of the enhanced hypercubes.
Theor. Comput. Sci., 2017

Uniquely Cycle-Saturated Graphs.
Journal of Graph Theory, 2017

Minimum Degree and Dominating Paths.
Journal of Graph Theory, 2017

The Game Saturation Number of a Graph.
Journal of Graph Theory, 2017

Decomposition of sparse graphs into forests: The Nine Dragon Tree Conjecture for k ≤ 2.
J. Comb. Theory, Ser. B, 2017

Bar Visibility Numbers for Hypercubes and Outerplanar Digraphs.
Graphs and Combinatorics, 2017

An introduction to the discharging method via graph coloring.
Discrete Mathematics, 2017

2016
To catch a falling robber.
Theor. Comput. Sci., 2016

Anti-Ramsey Problems for t Edge-Disjoint Rainbow Spanning Subgraphs: Cycles, Matchings, or Trees.
Journal of Graph Theory, 2016

Cubic Graphs with Large Ratio of Independent Domination Number to Domination Number.
Graphs and Combinatorics, 2016

Rainbow Spanning Subgraphs of Small Diameter in Edge-Colored Complete Graphs.
Graphs and Combinatorics, 2016

A new proof that 4-connected planar graphs are Hamiltonian-connected.
Discussiones Mathematicae Graph Theory, 2016

Extremal problems for degree-based topological indices.
Discrete Applied Mathematics, 2016

On r-dynamic coloring of graphs.
Discrete Applied Mathematics, 2016

2015
The adversary degree-associated reconstruction number of double-brooms.
J. Discrete Algorithms, 2015

Sum-Paintability of Generalized Theta-Graphs.
Graphs and Combinatorics, 2015

Beyond Ohba's Conjecture: A bound on the choice number of k-chromatic graphs with n vertices.
Eur. J. Comb., 2015

Sharp bounds for the Chinese Postman Problem in 3-regular graphs and multigraphs.
Discrete Applied Mathematics, 2015

On r-dynamic coloring of grids.
Discrete Applied Mathematics, 2015

Sharp lower bounds on the fractional matching number.
Discrete Applied Mathematics, 2015

2014
Linear Discrepancy of Chain Products and Posets with Bounded Degree.
Order, 2014

The 1, 2, 3-Conjecture and 1, 2-Conjecture for sparse graphs.
Discussiones Mathematicae Graph Theory, 2014

Cutwidth of triangular grids.
Discrete Mathematics, 2014

Permutation bigraphs and interval containments.
Discrete Applied Mathematics, 2014

Equicovering Subgraphs of Graphs and Hypergraphs.
Electr. J. Comb., 2014

2013
Total Acquisition in Graphs.
SIAM J. Discrete Math., 2013

Extremal Problems for Game Domination Number.
SIAM J. Discrete Math., 2013

Visibility Number of Directed Graphs.
SIAM J. Discrete Math., 2013

Bounds on the k-dimension of Products of Special Posets.
Order, 2013

Decomposition of Sparse Graphs into Forests and a Graph with Bounded Degree.
Journal of Graph Theory, 2013

Extremal Graphs With a Given Number of Perfect Matchings.
Journal of Graph Theory, 2013

Choosability of Graphs with Bounded Order: Ohba's Conjecture and Beyond.
Electronic Notes in Discrete Mathematics, 2013

Degree Ramsey numbers for cycles and blowups of trees.
Eur. J. Comb., 2013

Rainbow edge-coloring and rainbow domination.
Discrete Mathematics, 2013

Acquisition-extremal graphs.
Discrete Applied Mathematics, 2013

Game matching number of graphs.
Discrete Applied Mathematics, 2013

Extensions to 2-Factors in Bipartite Graphs.
Electr. J. Comb., 2013

2012
Locating a robber on a graph via distance queries.
Theor. Comput. Sci., 2012

Revolutionaries and spies: Spy-good and spy-bad graphs.
Theor. Comput. Sci., 2012

Spanning Cycles Through Specified Edges in Bipartite Graphs.
Journal of Graph Theory, 2012

Overlap number of graphs.
Journal of Graph Theory, 2012

Packing of graphic n-tuples.
Journal of Graph Theory, 2012

The A4-structure of a graph.
Journal of Graph Theory, 2012

Packing of Steiner trees and S-connectors in graphs.
J. Comb. Theory, Ser. B, 2012

Cycle spectra of Hamiltonian graphs.
J. Comb. Theory, Ser. B, 2012

Connected Domination Number of a Graph and its Complement.
Graphs and Combinatorics, 2012

Uniquely C 4-Saturated Graphs.
Graphs and Combinatorics, 2012

Length thresholds for graphic lists given fixed largest and smallest entries and bounded gaps.
Discrete Mathematics, 2012

Degree Ramsey Numbers of Graphs.
Combinatorics, Probability & Computing, 2012

2011
Longest cycles in k-connected graphs with given independence number.
J. Comb. Theory, Ser. B, 2011

A short proof of the Berge-Tutte Formula and the Gallai-Edmonds Structure Theorem.
Eur. J. Comb., 2011

Matching and edge-connectivity in regular graphs.
Eur. J. Comb., 2011

Acyclic Sets in k-Majority Tournaments.
Electr. J. Comb., 2011

Equitable Hypergraph Orientations.
Electr. J. Comb., 2011

On-line Ramsey Theory for Bounded Degree Graphs.
Electr. J. Comb., 2011

A new proof of 3-colorability of Eulerian triangulations.
Ars Math. Contemp., 2011

2010
Balloons, cut-edges, matchings, and total domination in regular graphs of odd degree.
Journal of Graph Theory, 2010

Oriented diameter of graphs with diameter 3.
J. Comb. Theory, Ser. B, 2010

Forbidden subposets for fractional weak discrepancy at most k.
Eur. J. Comb., 2010

A short constructive proof of the Erdos-Gallai characterization of graphic lists.
Discrete Mathematics, 2010

Decomposition of sparse graphs, with application to game coloring number.
Discrete Mathematics, 2010

Degree-associated reconstruction number of graphs.
Discrete Mathematics, 2010

Rainbow Matching in Edge-Colored Graphs.
Electr. J. Comb., 2010

The Edge-Count Criterion for Graphic Lists.
Electr. J. Comb., 2010

2009
On the Pagenumber of k-Trees.
SIAM J. Discrete Math., 2009

Matching Extendability in Hypercubes.
SIAM J. Discrete Math., 2009

Classes of 3-Regular Graphs That Are (7, 2)-Edge-Choosable.
SIAM J. Discrete Math., 2009

Extremal Problems for Roman Domination.
SIAM J. Discrete Math., 2009

Implications among linkage properties in graphs.
Journal of Graph Theory, 2009

Proper path-factors and interval edge-coloring of (3, 4)-biregular bigraphs.
Journal of Graph Theory, 2009

Independence Number of 2-Factor-Plus-Triangles Graphs.
Electr. J. Comb., 2009

Chromatic Number for a Generalization of Cartesian Product Graphs.
Electr. J. Comb., 2009

Repetition Number of Graphs.
Electr. J. Comb., 2009

2008
Problem 11372.
The American Mathematical Monthly, 2008

Long Local Searches for Maximal Bipartite Subgraphs.
SIAM J. Discrete Math., 2008

Duality for Semiantichains and Unichain Coverings in Products of Special Posets.
Order, 2008

Circular chromatic index of Cartesian products of graphs.
Journal of Graph Theory, 2008

Pebbling and optimal pebbling in graphs.
Journal of Graph Theory, 2008

The hub number of a graph.
Inf. Process. Lett., 2008

Triangle-free planar graphs with minimum degree 3 have radius at least 3.
Discussiones Mathematicae Graph Theory, 2008

Tree-Thickness and Caterpillar-Thickness under Girth Constraints.
Electr. J. Comb., 2008

Optimal strong parity edge-coloring of complete graphs.
Combinatorica, 2008

2007
Improved Bounds on Families Under k -wise Set-Intersection Constraints.
Graphs and Combinatorics, 2007

Editorial Announcement: Hello, World.
Discrete Mathematics, 2007

Research problems from the 5th Slovenian Conference (Bled, 2003).
Discrete Mathematics, 2007

Short proofs for cut-and-paste sorting of permutations.
Discrete Mathematics, 2007

2006
Extending precolorings to circular colorings.
J. Comb. Theory, Ser. B, 2006

Chvátal's Condition cannot hold for both a graph and its complement.
Discussiones Mathematicae Graph Theory, 2006

2005
Nordhaus-Gaddum-type Theorems for decompositions into many parts.
Journal of Graph Theory, 2005

Hypergraph Extension Of The Alon-Tarsi List Coloring Theorem.
Combinatorica, 2005

2004
Adjacency Matrices That Are Incidence Matrices: 10967.
The American Mathematical Monthly, 2004

The Bar Visibility Number of a Graph.
SIAM J. Discrete Math., 2004

Precoloring Extensions of Brooks' Theorem.
SIAM J. Discrete Math., 2004

Homomorphisms from sparse graphs with large girth.
J. Comb. Theory, Ser. B, 2004

On Pattern Ramsey Numbers of Graphs.
Graphs and Combinatorics, 2004

Maximum face-constrained coloring of plane graphs.
Discrete Mathematics, 2004

Edge-colorings of complete graphs that avoid polychromatic trees.
Discrete Mathematics, 2004

Interval numbers of powers of block graph.
Discrete Mathematics, 2004

Graphic and Protographic Lists of Integers.
Electr. J. Comb., 2004

2003
A list analogue of equitable coloring.
Journal of Graph Theory, 2003

Isometric cycles, cutsets, and crowning of bridged graphs.
Journal of Graph Theory, 2003

Probabilistic Methods for Decomposition Dimension of Graphs.
Graphs and Combinatorics, 2003

On the existence of Hamiltonian paths in the cover graph of M(n).
Discrete Mathematics, 2003

On the Erdos-Simonovits-So's Conjecture about the Anti-Ramsey Number of a Cycle.
Combinatorics, Probability & Computing, 2003

2002
Problem 10967.
The American Mathematical Monthly, 2002

The Chromatic Spectrum of Mixed Hypergraphs.
Graphs and Combinatorics, 2002

Maximum Face-Constrained Coloring of Plane Graphs.
Electronic Notes in Discrete Mathematics, 2002

Edge-Colorings of Complete Graphs that Avoid Polychromatic Trees.
Electronic Notes in Discrete Mathematics, 2002

On restricted edge-colorings of bicliques.
Discrete Mathematics, 2002

A Fibonacci tiling of the plane.
Discrete Mathematics, 2002

Foreword.
Discrete Mathematics, 2002

A Proof of the Two-path Conjecture.
Electr. J. Comb., 2002

2001
Structural Diagnosis of Wiring Networks: Finding Connected Components of Unknown Subgraphs.
SIAM J. Discrete Math., 2001

Ramsey Theory and Bandwidth of Graphs.
Graphs and Combinatorics, 2001

Realizing degree imbalances in directed graphs.
Discrete Mathematics, 2001

2000
Correction to Edge-Bandwidth of Graphs.
SIAM J. Discrete Math., 2000

Connected Domination and Spanning Trees with Many Leaves.
SIAM J. Discrete Math., 2000

Multiple vertex coverings by specified induced subgraphs.
Journal of Graph Theory, 2000

The edge-bandwidth of theta graphs.
Journal of Graph Theory, 2000

On the Number of Vertices with Specified Eccentricity.
Graphs and Combinatorics, 2000

A note on generalized chromatic number and generalized girth.
Discrete Mathematics, 2000

Perfection thickness of graphs.
Discrete Mathematics, 2000

1999
Partially Ordered Sets.
Proceedings of the Handbook of Discrete and Combinatorial Mathematics., 1999

Edge-Bandwidth of Graphs.
SIAM J. Discrete Math., 1999

Diagnosis of Wiring Networks: An Optimal Randomized Algorithm for Finding Connected Components of Unknown Graphs.
SIAM J. Comput., 1999

Intersection representation of digraphs in trees with few leaves.
Journal of Graph Theory, 1999

Coloring of trees with minimum sum of colors.
Journal of Graph Theory, 1999

Chromatic spectrum is broken.
Electronic Notes in Discrete Mathematics, 1999

A short proof that 'proper = unit'.
Discrete Mathematics, 1999

1998
Star-factors of tournaments.
Journal of Graph Theory, 1998

The leafage of a chordal graph.
Discussiones Mathematicae Graph Theory, 1998

Short proofs for interval digraphs.
Discrete Mathematics, 1998

Line digraphs and coreflexive vertex sets.
Discrete Mathematics, 1998

Bandwidth and density for block graphs.
Discrete Mathematics, 1998

1997
Total interval number for graphs with bounded degree.
Journal of Graph Theory, 1997

The Number of Dependent Arcs in an Acyclic Orientation.
J. Comb. Theory, Ser. B, 1997

Optimal Structural Diagnosis of Wiring Networks.
Proceedings of the Digest of Papers: FTCS-27, 1997

1996
The Total Interval Number of a Graph II: Trees and Complexity.
SIAM J. Discrete Math., 1996

The superregular graphs.
Journal of Graph Theory, 1996

Large 2P3-free graphs with bounded degree.
Discrete Mathematics, 1996

1995
A Graph-Theoretic Game and Its Application to the k-Server Problem.
SIAM J. Comput., 1995

Maximum Bandwidth Under Edge Addition.
Journal of Graph Theory, 1995

The 2-intersection number of paths and bounded-degree trees.
Journal of Graph Theory, 1995

Acyclic orientations of complete bipartite graphs.
Discrete Mathematics, 1995

Representing digraphs using intervals or circular arcs.
Discrete Mathematics, 1995

Interval number of special posets and random posets.
Discrete Mathematics, 1995

Optimal Algorithms for Finding Connected Components of an Unknown Graph.
Proceedings of the Computing and Combinatorics, First Annual International Conference, 1995

1994
Covering a Poset by Interval Orders.
J. Comb. Theory, Ser. A, 1994

Relaxed chromatic numbers of graphs.
Graphs and Combinatorics, 1994

Size, chromatic number, and connectivity.
Graphs and Combinatorics, 1994

The p-Intersection Number of a Complete Bipartite Graph and Orthogonal Double Coverings of a Clique.
Combinatorica, 1994

1993
Large P4-free graphs with bounded degree.
Journal of Graph Theory, 1993

Generating Linear Extensions by Adjacent Transpositions.
J. Comb. Theory, Ser. B, 1993

The total interval number of a graph, I: Fundamental classes.
Discrete Mathematics, 1993

Subtree and Substar Intersection Numbers.
Discrete Applied Mathematics, 1993

Clique coverings of the edges of a random graph.
Combinatorica, 1993

1992
Large regular graphs with no induced 2K2.
Graphs and Combinatorics, 1992

1991
Spanning Trees with Many Leaves.
SIAM J. Discrete Math., 1991

The interval inclusion number of a partially ordered set.
Discrete Mathematics, 1991

The maximum number of winning 2-sets.
Discrete Applied Mathematics, 1991

Vertex Degrees in Planar Graphs.
Proceedings of the Planar Graphs, 1991

A Graph-Theoretic Game and its Application to the k-Server Problem (Extended Abstract).
Proceedings of the On-Line Algorithms, 1991

1990
Tetrahedrizing Point Sets in Three Dimensions.
J. Symb. Comput., 1990

1989
Circular-arc digraphs: A characterization.
Journal of Graph Theory, 1989

Interval digraphs: An analogue of interval graphs.
Journal of Graph Theory, 1989

A length-width inequality for partially ordered sets with two-element cutsets.
J. Comb. Theory, Ser. B, 1989

A short proof of the degree bound for interval number.
Discrete Mathematics, 1989

1988
On the Construction of Communication Networks Satisfying Bounded Fan-In of Service Ports.
IEEE Trans. Computers, 1988

Pagenumber of complete bipartite graphs.
Journal of Graph Theory, 1988

Election in a Complete Network with a Sense of Direction.
Inf. Process. Lett., 1988

The addition game: an abstraction of a communication problem.
Discrete Mathematics, 1988

1987
An improved edge bound on the interval number of a graph.
Journal of Graph Theory, 1987

Sorting by insertion of leading elements.
J. Comb. Theory, Ser. A, 1987

Unichain coverings in partial orders with the nested saturation property.
Discrete Mathematics, 1987

Poset boxicity of graphs.
Discrete Mathematics, 1987

Two easy duality theorems for product partial orders.
Discrete Applied Mathematics, 1987

1986
"Poly-unsaturated" posets: The Greene-Kleitman theorem is best possible.
J. Comb. Theory, Ser. A, 1986

Election in a Complete Network with a Sense of Direction.
Inf. Process. Lett., 1986

1985
Decomposition of product graphs into complete bipartite subgraphs.
Discrete Mathematics, 1985

A note on the interval number of a graph.
Discrete Mathematics, 1985

1984
Recognizing graphs with fixed interval number is NP-complete.
Discrete Applied Mathematics, 1984

The interval number of a complete multipartite graph.
Discrete Applied Mathematics, 1984

Regressions and monotone chains: a ramsey - type extermal problem for partial orders.
Combinatorica, 1984

1983
Some Remarks on Normalized Matching.
J. Comb. Theory, Ser. A, 1983

The interval number of a planar graph: Three intervals suffice.
J. Comb. Theory, Ser. B, 1983

1982
A class of solutions to the gossip problem, part III.
Discrete Mathematics, 1982

A class of solutions to the gossip problem, part II.
Discrete Mathematics, 1982

A class of solutions to the gossip problem, part I.
Discrete Mathematics, 1982

1980
Extremal Values of the Interval Number of a Graph.
SIAM J. Matrix Analysis Applications, 1980

A Symmetric Chain Decomposition of L(4, n).
Eur. J. Comb., 1980

1979
The Number of Meets between Two Subsets of a Lattice.
J. Comb. Theory, Ser. A, 1979

Skew chain orders and sets of rectangles.
Discrete Mathematics, 1979


  Loading...