Douglas West

Q: What Schools Are Affiliated With Douglas West

Douglas West is affiliated with the following schools: Zhejiang Normal University, Massachusetts Institute of Technology, University of Illinois Urbana-Champaign

Douglas West 's AcademicInfluence.com Rankings

Douglas West

Mathematics

#1042

World Rank

#1781

Historical Rank

#453

USA Rank

Graph Theory

#25

World Rank

#32

Historical Rank

USA Rank

Measure Theory

#752

World Rank

#1009

Historical Rank

#298

USA Rank

mathematics Degrees

Download Badge

Mathematics

Why Is Douglas West Influential?

(Suggest an Edit or Addition)

According to Wikipedia, Douglas Brent West is a professor of graph theory at University of Illinois at Urbana-Champaign. He received his Ph.D. from Massachusetts Institute of Technology in 1978; his advisor was Daniel Kleitman. He is the "W" in G. W. Peck, a pseudonym for a group of six mathematicians that includes West. He is the editor of the journal Discrete Mathematics.

(See a Problem?)

Douglas West 's Published Works

Number of citations in a given year to any of this author's works

Total number of citations to an author for the works they published in a given year. This highlights publication of the most important work(s) by the author

Published Works

Introduction to Graph Theory (1995) (4257)
Problems and Solutions (2015) (339)
A Graph-Theoretic Game and Its Application to the k-Server Problem (1995) (290)
Extremal Problems for Roman Domination (2009) (165)
Interval digraphs: An analogue of interval graphs (1989) (114)
Extremal Problems for Game Domination Number (2013) (113)
Extremal Values of the Interval Number of a Graph (1980) (102)
Connected Domination and Spanning Trees with Many Leaves (2000) (96)
Spanning Trees with Many Leaves (1991) (93)
The Borsuk-Ulam theorem and bisection of necklaces (1986) (89)
Tetrahedrizing Point Sets in Three Dimensions (1988) (88)
A short proof that 'proper = unit' (1998) (78)
Bisection of Circle Colorings (1985) (68)
The Chromatic Spectrum of Mixed Hypergraphs (2002) (68)
Edge-Colorings of Complete Graphs that Avoid Polychromatic Trees (2002) (65)
Homomorphisms from sparse graphs with large girth (2004) (62)
The interval number of a planar graph: Three intervals suffice (1983) (60)
An introduction to the discharging method via graph coloring (2013) (59)
A list analogue of equitable coloring (2003) (57)
On the Erdős–Simonovits–Sós Conjecture about the Anti-Ramsey Number of a Cycle (2003) (55)
Recognizing graphs with fixed interval number is NP-complete (1984) (54)
Pagenumber of complete bipartite graphs (1988) (53)
Pebbling and optimal pebbling in graphs (2005) (49)
Eigensharp graphs: decomposition into complete bipartite subgraphs (1988) (46)
Parameters of Partial Orders and Graphs: Packing, Covering, and Representation (1985) (44)
A short constructive proof of the Erdos-Gallai characterization of graphic lists (2010) (44)
On r-dynamic coloring of graphs (2016) (43)
Rainbow Matching in Edge-Colored Graphs (2010) (43)
Balloons, cut-edges, matchings, and total domination in regular graphs of odd degree (2010) (42)
The hub number of a graph (2008) (40)
The leafage of a chordal graph (1998) (40)
Coloring of trees with minimum sum of colors (1999) (40)
A Symmetric Chain Decomposition of L(4, n) (1979) (39)
Multitrack Interval Graphs (1995) (38)
Election in a Complete Network with a Sense of Direction (1986) (37)
Packing of graphic n‐tuples (2012) (35)
Packing of Steiner trees and S-connectors in graphs (2012) (35)
Sorting by insertion of leading elements (1987) (35)
Locating a robber on a graph via distance queries (2012) (32)
A Guide to the Discharging Method (2013) (32)
Extremal Problems in Partially Ordered Sets (1982) (32)
Maximum Face-Constrained Coloring of Plane Graphs (2002) (31)
Circular-arc digraphs: A characterization (1989) (31)
Balloons, cut‐edges, matchings, and total domination in regular graphs of odd degree (2010) (31)
On r-dynamic coloring of grids (2014) (30)
Mathematical Thinking: Problem-Solving and Proofs (1996) (30)
Decomposition of Sparse Graphs into Forests and a Graph with Bounded Degree (2013) (30)
Thep-intersection number of a complete bipartite graph and orthogonal double coverings of a clique (1994) (29)
Proper path‐factors and interval edge‐coloring of (3,4)‐biregular bigraphs (2007) (28)
Ordered Ramsey theory and track representations of graphs (2015) (28)
Matching and edge-connectivity in regular graphs (2011) (26)
Oriented diameter of graphs with diameter 3 (2010) (26)
A class of solutions to the gossip problem, part I (1982) (26)
On-line Ramsey Theory for Bounded Degree Graphs (2011) (26)
Short proofs for interval digraphs (1998) (26)
Precoloring Extensions of Brooks' Theorem (2005) (25)
A short proof of the Berge-Tutte Formula and the Gallai-Edmonds Structure Theorem (2011) (25)
Connected Domination Number of a Graph and its Complement (2012) (22)
Length thresholds for graphic lists given fixed largest and smallest entries and bounded gaps (2012) (22)
Coloring, sparseness and girth (2014) (22)
Representing digraphs using intervals or circular arcs (1995) (22)
Degree-associated reconstruction number of graphs (2010) (21)
Poset boxicity of graphs (1987) (21)
Chromatic spectrum is broken (1999) (21)
The Number of Dependent Arcs in an Acyclic Orientation (1997) (20)
Bandwidth and density for block graphs (1998) (20)
A new proof of 3-colorability of Eulerian triangulations (2011) (20)
Clique coverings of the edges of a random graph (1993) (20)
GOSSIPING WITHOUT DUPLICATE TRANSMISSIONS (1982) (20)
Realizing degree imbalances in directed graphs (1998) (20)
Sum-Paintability of Generalized Theta-Graphs (2015) (19)
The interval number of a complete multipartite graph (1984) (19)
Some conjectures of Graffiti . pc on total domination (2007) (19)
Classes of Interval Digraphs and 0,1-matrices (1997) (19)
Acyclic orientations of complete bipartite graphs (1995) (19)
Reconstruction from the deck of k ‐vertex induced subgraphs (2018) (18)
Repetition Number of Graphs (2009) (18)
Generating Linear Extensions by Adjacent Transpositions (1993) (18)
Nordhaus–Gaddum‐type Theorems for decompositions into many parts (2005) (18)
Degree Ramsey Numbers of Graphs (2012) (18)
Three Topics in Online List Coloring (2014) (18)
Every outerplanar graph is the union of two interval graphs (1999) (18)
On Pattern Ramsey Numbers of Graphs (2004) (17)
A note on the interval number of a graph (1985) (17)
Anti‐Ramsey Problems for t Edge‐Disjoint Rainbow Spanning Subgraphs: Cycles, Matchings, or Trees (2016) (16)
The Bar Visibility Number of a Graph (2005) (16)
The Number of Meets between Two Subsets of a Lattice (1979) (15)
Short proofs for cut-and-paste sorting of permutations (2006) (15)
Optimal strong parity edge-coloring of complete graphs (2008) (15)
CIRCULAR (5;2)-COLORING OF SPARSE GRAPHS (2008) (15)
Game matching number of graphs (2012) (15)
Relaxed chromatic numbers of graphs (1994) (15)
Degree Ramsey numbers for cycles and blowups of trees (2013) (15)
Decomposition of sparse graphs, with application to game coloring number (2010) (14)
The vulnerability of the diameter of the enhanced hypercubes (2016) (14)
Edge-Bandwidth of Graphs (1999) (14)
Cycle spectra of Hamiltonian graphs (2012) (14)
Cubic Graphs with Large Ratio of Independent Domination Number to Domination Number (2016) (14)
A class of solutions to the gossip problem, part II (1982) (14)
Nordhaus–Gaddum-type Theorems for decompositions into many parts (2005) (13)
Decomposition of product graphs into complete bipartite subgraphs (1985) (13)
The edge-bandwidth of theta graphs (2000) (13)
Extending precolorings to circular colorings (2006) (13)
Parity and Strong Parity Edge-Colorings of Graphs (2007) (13)
A note on generalized chromatic number and generalized girth (1998) (13)
Longest cycles in k-connected graphs with given independence number (2011) (13)
Hypergraph Extension Of The Alon-Tarsi List Coloring Theorem (2005) (13)
Decomposition of cartesian products of regular graphs into isomorphic trees (2013) (13)
Ramsey Theory and Bandwidth of Graphs (2001) (12)
Total Acquisition in Graphs (2013) (12)
The total interval number of a graph, I: Fundamental classes (1993) (12)
Skew chain orders and sets of rectangles (1979) (12)
Semiantichains and Unichain Coverings in Direct Products of Partial Orders (1981) (12)
The Total Interval Number of a Graph II: Trees and Complexity (1996) (11)
Extremal Graphs With a Given Number of Perfect Matchings (2013) (11)
The Game Saturation Number of a Graph (2014) (11)
Extremal results and algorithms for degree sequences of graphs (1993) (11)
The bricklayer problem and the Strong Cycle Lemma (1998) (11)
Large regular graphs with no induced 2K2 (1992) (11)
An improved edge bound on the interval number of a graph (1987) (11)
50 Years of Combinatorics, Graph Theory, and Computing (2019) (11)
Choosability of Graphs with Bounded Order: Ohba's Conjecture and Beyond (2013) (10)
Beyond Ohba's Conjecture: A bound on the choice number of k-chromatic graphs with n vertices (2013) (10)
Vertex Degrees in Planar Graphs (1991) (10)
Some Remarks on Normalized Matching (1983) (10)
The interval inclusion number of a partially ordered set (1991) (10)
Visibility Number of Directed Graphs (2013) (10)
A short proof of the degree bound for interval number (1989) (10)
Revolutionaries and spies: Spy-good and spy-bad graphs (2012) (10)
Sharp lower bounds on the fractional matching number (2015) (10)
A class of solutions to the gossip problem, part III (1978) (9)
Extensions to 2-Factors in Bipartite Graphs (2013) (9)
Research problems from the 5th Slovenian Conference (Bled, 2003) (2007) (9)
Minimum Degree and Dominating Paths (2017) (9)
Decomposition of sparse graphs into forests: The Nine Dragon Tree Conjecture for k ≤ 2 (2015) (9)
Circular chromatic index of Cartesian products of graphs (2008) (9)
On the Pagenumber of k-Trees (2009) (9)
Problems and Solutions (2012) (9)
Degree-associated reconstruction parameters of complete multipartite graphs and their complements (2015) (8)
Problems and Solutions (2013) (8)
Unichain coverings in partial orders with the nested saturation property (1987) (8)
Degree Lists and Connectedness are 3-Reconstructible for Graphs with At Least Seven Vertices (2019) (8)
Revolutionaries and spies on trees and unicyclic graphs (2011) (8)
Acquisition-extremal graphs (2013) (8)
On the Number of Vertices with Specified Eccentricity (2000) (8)
Matching Extendability in Hypercubes (2009) (8)
Lower Bounds on Common Knowledge in Distributed Algorithms (1984) (8)
The A4‐structure of a graph (2012) (8)
"Poly-unsaturated" posets: The Greene-Kleitman theorem is best possible (1986) (7)
Extremal problems for degree-based topological indices (2016) (7)
Line digraphs and coreflexive vertex sets (1998) (7)
The adversary degree-associated reconstruction number of double-brooms (2015) (7)
Uniquely C4-Saturated Graphs (2012) (7)
Permutation bigraphs and interval containments (2014) (7)
On restricted edge-colorings of bicliques (2002) (7)
Improved Bounds on Families Under k-wise Set-Intersection Constraints (2007) (7)
Online sum-paintability: The slow-coloring game (2018) (7)
Acyclic Sets in k-Majority Tournaments (2011) (7)
Large 2P3-free graphs with bounded degree (1996) (7)
Large P4-free graphs with bounded degree (1993) (6)
The 2-intersection number of paths and bounded-degree trees (1995) (6)
Overlap number of graphs (2010) (6)
The 1 , 2 , 3-Conjecture And 1 , 2-Conjecture For Sparse Graphs (2013) (6)
Maximum Bandwidth Under Edge Addition (1995) (6)
Subtree and Substar Intersection Numbers (1993) (6)
Implications among linkage properties in graphs (2009) (6)
A length-width inequality for partially ordered sets with two-element cutsets (1989) (6)
On the existence of Hamiltonian paths in the cover graph of M(n) (2003) (6)
Parity Edge-Coloring of Graphs (2006) (5)
Acyclic graphs with at least 2 ℓ + 1 vertices are ℓ -recognizable (2020) (5)
Regressions and monotone chains: A ramsey-type extremal problem for partial orders (1984) (5)
Multiple vertex coverings by specified induced subgraphs (1999) (5)
Total interval number for graphs with bounded degree (1997) (5)
Triangle-free planar graphs with minimum degree 3 have radius at least 3 (2008) (5)
On Reconstruction of Graphs From the Multiset of Subgraphs Obtained by Deleting ℓ Vertices (2020) (5)
Pairs of Adjacent Hamiltonian Circuits with Small Intersection (1978) (5)
Problems and Solutions (2013) (5)
Gray Code Results for Acyclic Orientations (2015) (5)
An entropy inequality for the bi-multivariate hypergeometric distribution (1989) (4)
Optimal structural diagnosis of wiring networks (1997) (4)
On reconstruction of n-vertex graphs from the multiset of (n – ℓ)-vertex induced subgraphs (2020) (4)
A Proof of the Two-path Conjecture (2002) (4)
Star-factors of tournaments (1998) (4)
Chain-making games in grid-like posets (2011) (4)
Networks and chain coverings in partial orders and their products (1985) (4)
Forbidden subposets for fractional weak discrepancy at most k (2010) (4)
Linear Discrepancy and Products of Chains (2008) (4)
On the Construction of Communication Networks Satisfying Bounded Fan-In of Service Ports (1988) (4)
On-line size Ramsey number for monotone k-uniform ordered paths with uniform looseness (2018) (4)
The A 4-structure of a graph (2010) (4)
Online sum-paintability: Slow-coloring of trees (2016) (4)
Partially Ordered Sets (1999) (4)
Spanning Cycles Through Specified Edges in Bipartite Graphs (2012) (4)
3-regular Graphs Are 2-reconstructible (2019) (4)
Rainbow edge-coloring and rainbow domination (2013) (4)
Matching extendibility in hypercubes (2008) (4)
Cut-Edges and Regular Factors in Regular Graphs of Odd Degree (2018) (4)
Equitable Hypergraph Orientations (2011) (3)
Long Local Searches for Maximal Bipartite Subgraphs (2008) (3)
Ramsey Numbers of Interval 2-Chromatic Ordered Graphs (2018) (3)
( 5 , 2 )-Coloring of Sparse Graphs (2007) (3)
Two easy duality theorems for product partial orders (1987) (3)
Extremal problems on saturation for the family of k-edge-connected graphs (2017) (3)
Randomly twisted hypercubes (2018) (3)
Duality for Semiantichains and Unichain Coverings in Products of Special Posets (2008) (3)
Sharp bounds for the Chinese Postman Problem in 3-regular graphs and multigraphs (2015) (3)
Rainbow spanning subgraphs of edge-colored complete graphs (2013) (3)
Multicolor on-line degree Ramsey numbers of trees (2012) (3)
Fractional and circular separation dimension of graphs (2016) (3)
Bar Visibility Numbers for Hypercubes and Outerplanar Digraphs (2017) (3)
Extensions of matroid covering and packing (2019) (3)
The addition game: an abstraction of a communication problem (1988) (2)
Interval numbers of powers of block graph (2004) (2)
Interval number of special posets and random posets (1995) (2)
Decomposition of regular hypergraphs (2018) (2)
Bounds on the k-dimension of Products of Special Posets (2013) (2)
Structural Diagnosis of Wiring Networks: Finding Connected Components of Unknown Subgraphs (2001) (2)
Chvátal's Condition cannot hold for both a graph and its complement (2006) (2)
Tree-Thickness and Caterpillar-Thickness under Girth Constraints (2008) (2)
Antipodal Edge-Colorings of Hypercubes (2019) (2)
Wide posets with fixed height and cutset number (1990) (2)
Problems and Solutions (2015) (2)
Diagnosis of Wiring Networks: An Optimal Randomized Algorithm for Finding Connected Components of Unknown Graphs (1999) (2)
Lichiardopol's Conjecture on Disjoint Cycles in Tournaments (2017) (2)
Problems and solutions (2002) (2)
Problems and Solutions (2017) (2)
Induced Tur?an problems: Largest Pm-free graphs with bounded degree (2005) (2)
Cutwidth of triangular grids (2014) (2)
The Edge-Count Criterion for Graphic Lists (2010) (2)
The unit acquisition number of a graph (2017) (2)
Optimal Algorithms for Finding Connected Components of an Unknown Graph (1995) (2)
Interval Representations of Cliques and of Subset Intersection Graphs a (1989) (2)
A New Proof that 4-Connected Planar Graphs are Hamiltonian-Connected (2016) (2)
Online Paintability: The Slow-Coloring Game (2015) (2)
Problems and Solutions (2011) (2)
The maximum number of winning 2-sets (1991) (1)
Acyclic graphs with at least $2\ell+1$ vertices are $\ell$-recognizable (2021) (1)
Adding up to powers (1990) (1)
The slow-coloring game on sparse graphs: $k$-degenerate, planar, and outerplanar (2018) (1)
Trifold arrangements and cevian dissections (2001) (1)
Problems and Solutions (2018) (1)
Balloons, Chinese Postman Problem and Cycle Double Cover in Cubic Graphs (2009) (1)
Probabilistic Methods for Decomposition Dimension of Graphs (2003) (1)
Regressions and monotone chains II: The poset of integer intervals (1987) (1)
Chromatic Number for a Generalization of Cartesian Product Graphs (2009) (1)
Vertex Degrees in Outerplanar Graphs (2010) (1)
Uniquely Cycle‐Saturated Graphs (2015) (1)
Problems and Solutions (2014) (1)
Problems and Solutions (2016) (1)
Problems and Solutions (2008) (1)
Problems And Solutions (2016) (1)
Isometric cycles, cutsets, and crowning of bridged graphs (2003) (1)
Bounds for eccentricity-based parameters of graphs (2023) (1)
Graphic and Protographic Lists of Integers (2004) (1)
A Graph-Theoretic Game and its Application to the k-Server Problem (Extended Abstract) (1991) (1)
Correction to Edge-Bandwidth of Graphs (2000) (1)
Linear Discrepancy of Chain Products and Posets with Bounded Degree (2014) (1)
Problems and Solutions (2021) (1)
Problems and Solutions (2016) (1)
Covering a Poset by Interval Orders (1994) (1)
Reconstruction from $k$-decks for graphs with maximum degree 2 (2016) (1)
A Fibonacci tiling of the plane (2002) (1)
Rainbow Spanning Subgraphs of Small Diameter in Edge-Colored Complete Graphs (2016) (1)
Equicovering Subgraphs of Graphs and Hypergraphs (2014) (1)
Independence Number of 2-Factor-Plus-Triangles Graphs (2009) (1)
Size, chromatic number, and connectivity (1994) (1)
Sum-Paintability of Generalized Theta-Graphs (2014) (1)
Upper bounds for bar visibility of subgraphs and n-vertex graphs (2019) (1)
Sum-Paintability : The Slow-Coloring Game (2018) (1)
Elementary Problems: E3289-E3294 (1988) (1)
Perfection thickness of graphs (2000) (1)
On the Bar Visibility Number of Complete Bipartite Graphs (2019) (1)
Problems and solutions (a collection of problems) (1991) (0)
The superregular graphs (1996) (0)
Problems and Solutions (2019) (0)
Problems and Solutions (2005) (0)
Problems and Solutions (2005) (0)
Problems and Solutions (2011) (0)
Problems and Solutions (2021) (0)
Problems and Solutions (2008) (0)
Problems and Solutions (2017) (0)
Problems and Solutions (2011) (0)
Problems and Solutions (2000) (0)
Problems and Solutions (2010) (0)
Problems and Solutions (2010) (0)
Problems and Solutions (2004) (0)
Problems and Solutions (2008) (0)
Problems and Solutions (2014) (0)
Problems and Solutions (2019) (0)
Problems and Solutions (2002) (0)
Problems and Solutions (2004) (0)
Problems and solutions (2004) (0)
Problems and Solutions (2006) (0)
Problems and Solutions (2019) (0)
Problems and Solutions (2005) (0)
An Accompaniment to Higher Mathematics.@@@Journey into Mathematics: An Introduction to Proofs.@@@Mathematical Thinking: Problem Solving and Proofs. (1999) (0)
Problems and Solutions (2017) (0)
Problems and Solutions (2006) (0)
Problems and Solutions (2015) (0)
Problems and Solutions (2012) (0)
The Chinese Postman Problem in Regular Graphs of Odd Degree Suil O (2011) (0)
r-dynamic Colroing of Graphs (2012) (0)
Foreword (2002) (0)
Problems and Solutions (2017) (0)
Problems and Solutions (2003) (0)
Problems and Solutions (2019) (0)
C O ] 2 2 M ar 2 02 1 Acyclic graphs with at least 2 l + 1 vertices are l-recognizable (2021) (0)
PROBLEMS AND SOLUTIONS (2020) (0)
Problems and Solutions (2016) (0)
Invited Talks Symmetry , Hadwiger number , pointwise limit of graphs (2008) (0)
Problems and Solutions (2011) (0)
Problems and Solutions (2000) (0)
Problems and Solutions (2020) (0)
Problems and Solutions (2008) (0)
Problems and Solutions (2006) (0)
Problems and Solutions (2019) (0)
Problems: 10202-10210 (1992) (0)
Problems and Solutions (2009) (0)
Problems and Solutions (2017) (0)
Problems and Solutions (2011) (0)
Problems and solutions (2020) (0)
Problems and Solutions (2012) (0)
Problems and Solutions (2004) (0)
Problems and Solutions (2012) (0)
Problems and Solutions (2018) (0)
Problems and Solutions (2019) (0)
The Total Interval Number of a Graph, III: Tree-like Graphs (2021) (0)
Problems and Solutions (2003) (0)
Problems and Solutions (2015) (0)
Problems and solutions (2023) (0)
Problems and Solutions (2020) (0)
Problems and Solutions (2018) (0)
Problems and Solutions (2013) (0)
Degree Lists and Connectedness are 3-Reconstructible for Graphs with At Least Seven Vertices (2020) (0)
Editorial Announcement: Hello, World (2007) (0)
Problems and Solutions (2006) (0)
Problems and solutions (2000) (0)
Problems and Solutions (2021) (0)
SPANNING TREES WITH MANY LEAVES 1 (2014) (0)
Problems and Solutions (2013) (0)
Problems and Solutions (2015) (0)
Problems and Solutions (2006) (0)
Degree-Splittability of Regular Multigraphs and Caterpillars (2008) (0)
Problems and Solutions (2015) (0)
Problems and solutions (2003) (0)
Coloring , sparseness , and girth Noga Alon (2014) (0)
Problems and Solutions (2010) (0)
Problems and Solutions (2006) (0)
Problems and Solutions (2013) (0)
Adjacency Matrices That Are Incidence Matrices: 10967 (2004) (0)
Problems and Solutions (2018) (0)
Paintability : The Slow-Coloring Game (2015) (0)
Problems and Solutions (2016) (0)
Problems and Solutions (2009) (0)
Problems and Solutions (2013) (0)
Problems and Solutions (2007) (0)
Problems and Solutions (2007) (0)
Some New Results on Bar Visibility of Digraphs (2021) (0)
Problems and Solutions (2004) (0)
Rainbow Spanning Subgraphs of Small Diameter in Edge-Colored Complete Graphs (2015) (0)
Problems and Solutions (2004) (0)
Problems and Solutions (2010) (0)
Problems and Solutions (2008) (0)
Problems and Solutions (2016) (0)
Problems and Solutions (2002) (0)
Compatible matchings in bipartite graphs (1985) (0)
Problems and Solutions (2015) (0)
Problems and Solutions (2009) (0)
Largest 2-Regular Subgraphs in 3-Regular Graphs (2019) (0)
$3$-reconstructibility of rooted trees (2022) (0)
Problems and Solutions (2012) (0)
Problems and Solutions (2003) (0)
Problems and solutions (2023) (0)
Cut-Edges and Regular Factors in Regular Graphs of Odd Degree (2020) (0)
Problems and Solutions (2010) (0)
Problems and Solutions (2016) (0)
Problems and Solutions (2010) (0)
The smallest k-regular hedge-connected graphs without 1-factors (2003) (0)
Problems and Solutions (2007) (0)
Problems and Solutions (2019) (0)
Problems and Solutions (2019) (0)
2 An Analogue of the Sauer-Spencer Theorem (2011) (0)
Connected Domination Number of a Graph and its Complement (2011) (0)
Systems of Overlap Representation for Families of Intervals (2022) (0)
Problems and Solutions (2014) (0)
Problems and Solutions (2018) (0)
Problems and Solutions (2017) (0)
Sharp lower bounds for the number of maximum matchings in bipartite multigraphs (2022) (0)
Problems and Solutions (2009) (0)
Problems and Solutions (2005) (0)
Problems and Solutions (2007) (0)
The Number of Perfect Matchings in M\"obius Ladders and Prisms (2020) (0)
Problems and solutions (1998) (0)
Problems and solutions (2003) (0)
The k-dimension of the product of S m and S n (2003) (0)
Ore , Berge – Tutte , and Gallai – Edmonds (2009) (0)
Bounds for Cut-and-Paste Sorting of Permutations (2009) (0)
Problems and Solutions (2007) (0)
PROBLEMS AND SOLUTIONS (2020) (0)
Problems and Solutions (2007) (0)
Problems and Solutions (2000) (0)
Large P4-Free Graphs with Bounded Degree MGng S. Chung (1993) (0)
Problems and Solutions (2005) (0)
Problems and Solutions (2002) (0)
Problems and Solutions (2011) (0)
Problems and Solutions (2004) (0)
Largest 2-Regular Subgraphs in 3-Regular Graphs (2019) (0)
Problems and Solutions (2000) (0)
Problems and Solutions (2018) (0)
Problems and Solutions (2018) (0)
Elementary Problems: E3384-E3390 (1990) (0)
Problems and Solutions (2021) (0)
Problems and Solutions (2000) (0)
of Cartesian Products of Graphs (2007) (0)
Problems and Solutions (2021) (0)
Degree-Splittability of Multigraphs and Caterpillars (2010) (0)
Problems and solutions (2017) (0)
Semiantiehains and Unichaln Coverings in Direct Product 8 of Partial Orders (1998) (0)
Strongly connectable digraphs and non-transitive dice (2015) (0)
Problems and solutions (1999) (0)
Problems and Solutions (2018) (0)
Cubic Graphs with Large Ratio of Independent Domination Number to Domination Number (2015) (0)
Problems and Solutions (2006) (0)
Fatigue-limits, fatigue thresholds and other random quantities in PVC pipes (2008) (0)
Problems and Solutions (2006) (0)
Problems and Solutions (2012) (0)
Cycles in Color-Critical Graphs (2019) (0)
Problems and Solutions (2008) (0)
Problems and Solutions (2003) (0)
Problems and Solutions (2012) (0)
Problems and Solutions (2007) (0)
Problems and Solutions (2007) (0)
N ov 2 01 7 The Unit Acquisition Number of a Graph (2018) (0)
Trees with at least 6 ℓ + 10 vertices are ℓ -reconstrucible (2022) (0)
Packing of Graphic Sequences (2009) (0)
Problems and Solutions (2012) (0)
Problems and Solutions (2009) (0)
Problems and Solutions (2015) (0)
$2$-Reconstructibility of Weakly Distance-Regular Graphs (2022) (0)
Problems and Solutions (2020) (0)
Problems and Solutions (2012) (0)
Representing digraphs using intervals or circular arcs Malay (2003) (0)
Problems and Solutions (2012) (0)
Problems and Solutions (2020) (0)
Sharp lower bounds for the number of matchings in bipartite multigraphs (2022) (0)
Problems and Solutions (2020) (0)
Problems and Solutions (2021) (0)
Sum-Paintability : Slow-Coloring of Trees (2017) (0)
Problems and Solutions (2009) (0)
Problems and Solutions (2004) (0)
Classes of 3-Regular Graphs That Are (7, 2)-Edge-Choosable (2008) (0)
Problems and Solutions (2004) (0)
Permutation Bigraphs : An Analogue of Permutation Graphs (2011) (0)
Problems and Solutions (2019) (0)
Problems and Solutions (2019) (0)
Problems and Solutions (2017) (0)
The 1, 2-Conjecture for graphs with relatively small chromatic number (2012) (0)
Problems and Solutions (2016) (0)
Problems and solutions (2023) (0)
Problems and Solutions (2008) (0)
Results on Linear Discrepancy (2012) (0)
Problems and Solutions (2011) (0)
Problems and Solutions (2004) (0)
Problems and Solutions (2013) (0)
PROBLEMS AND SOLUTIONS (2021) (0)
Problems and Solutions (2013) (0)
The Slow-coloring Game on Outerplanar, Planar, and $k$-degenerate Graphs (2018) (0)
Problems and Solutions (2020) (0)
Problems and Solutions (2016) (0)
Problems and Solutions (2010) (0)
On the 3-Reconstructibility of Trees and Rooted Trees (2021) (0)
Problems and Solutions (2000) (0)
Problems and Solutions (2014) (0)
Problems and Solutions (2003) (0)
Problems and Solutions (2018) (0)
Problems and Solutions (2003) (0)
Problems and solutions (2002) (0)
Problems and Solutions (2000) (0)
Problems and Solutions (2014) (0)
Problems and solutions (1998) (0)
A CLASS OF SOLWTIONS TO THE GOSSIP PRUDBLE PART I (1982) (0)
Problems and solutions (2002) (0)
Problems and Solutions (2002) (0)
Problems and Solutions (2002) (0)
Problems and solutions (2000) (0)
Intersection representation of digraphs in trees with few leaves (1998) (0)
Problems and Solutions (2005) (0)
Bounds on the k-dimension of Products of Special Posets (2012) (0)
Problems and Solutions (2009) (0)
Problems and Solutions (2014) (0)
Problems and Solutions (2013) (0)
Interval Number and Boxicity of Directed Graphs (1996) (0)
Problems and Solutions (2021) (0)
Problems and Solutions (2008) (0)
Problems and Solutions (2023) (0)
Problems and Solutions (2003) (0)
Problems and solutions (2022) (0)
Linear Discrepancy of Chain Products and Posets with Bounded Degree (2013) (0)
Problems and solutions (1998) (0)
Optimal Parity Edge-Coloring of Complete Graphs (2006) (0)
Problems and Solutions (2005) (0)
Problems and Solutions (2005) (0)
Maximum Sum of Bandwidths of Complementary Graphs 1. the Problem (1998) (0)
To catch a falling robber (2014) (0)
Circular chromatic Ramsey number (2017) (0)
Problems and Solutions (2007) (0)
Problems and Solutions (2002) (0)
Problems and Solutions (2008) (0)
Problems and Solutions (2009) (0)
PROBLEMS AND SOLUTIONS (2021) (0)
Coloring, sparseness and girth (2016) (0)
Problems and Solutions (2017) (0)
Problems and Solutions (2022) (0)
Review: Ian Anderson, Combinatorics of finite sets (1988) (0)
Problems and Solutions (2011) (0)
Problems and solutions (2001) (0)
Problems and Solutions (2006) (0)
Problems and solutions (1999) (0)
Problems and Solutions (2005) (0)
Problems and Solutions (with the collaboration of Paul Bracken, Ezra A. Brown Zachary Franco Christian Friesen László Lipták Rick Luttmann Frank B. Miles Lenhard Ng Kenneth Stolarsky Richard Stong Stan Wagon Lawrence Washington Elizabeth Wilmer Fuzhen Zhang and Li Zhou). (2020) (0)
Spanning Trees in 2-trees (2016) (0)
Edge-disjoint rainbow spanning subgraphs of edge-colored complete graphs : matchings and cycles (2013) (0)
Bar Visibility Numbers for Hypercubes and Outerplanar Digraphs (2016) (0)
Problems and Solutions (2011) (0)
Problems and Solutions (2010) (0)
Problems and Solutions (2005) (0)
Conne ted Domination and Spanning Trees with Many (2007) (0)
Uniquely C4-Saturated Graphs (2011) (0)
Problems and Solutions (2000) (0)
Introduction to Graph Theori (2001) (0)
Problems and Solutions (2011) (0)
Problems and Solutions (2003) (0)
Problems and Solutions (2000) (0)
Systems of Overlap Representation for Families of Intervals (2022) (0)
Problems and Solutions (2008) (0)
Problems and Solutions (2007) (0)
Problems and Solutions (2014) (0)
The Bricklayer Problem and the Strong (2016) (0)
Problems and solutions (2004) (0)
Problems and Solutions (2003) (0)
Problems and Solutions (2014) (0)
Problems and Solutions (2015) (0)

This paper list is powered by the following services:

Other Resources About Douglas West

en.wikipedia.org

What Schools Are Affiliated With Douglas West ?

Douglas West is affiliated with the following schools:

Douglas West 's Academic­Influence.com Rankings

Why Is Douglas West Influential?

Douglas West 's Published Works

Published Works

Other Resources About Douglas West

What Schools Are Affiliated With Douglas West ?

Douglas West 's AcademicInfluence.com Rankings