Douglas B. West

From MaRDI portal
Person:185079

Available identifiers

zbMath Open west.douglas-bWikidataQ5302097 ScholiaQ5302097MaRDI QIDQ185079

List of research outcomes

PublicationDate of PublicationType
Optimal algorithms for finding connected components of an unknown graph2023-12-12Paper
2-reconstructibility of strongly regular graphs and 2-partially distance-regular graphs2023-08-21Paper
Acyclic graphs with at least $2\ell+1$ vertices are $\ell$-recognizable2023-08-08Paper
Trees with at least $6\ell+11$ vertices are $\ell$-reconstructible2023-07-19Paper
Another Proof of the Generalized Tutte--Berge Formula for $f$-Bounded Subgraphs2023-07-03Paper
Bounds for eccentricity-based parameters of graphs2023-04-23Paper
\(3\)-reconstructibility of rooted trees2023-04-05Paper
Sharp lower bounds for the number of maximum matchings in bipartite multigraphs2022-11-18Paper
$2$-Reconstructibility of Weakly Distance-Regular Graphs2022-10-21Paper
Cycles in color-critical graphs2022-04-04Paper
Systems of overlap representation for families of intervals2022-03-15Paper
On the Bar Visibility Number of Complete Bipartite Graphs2021-10-18Paper
Strongly connectable digraphs and non-transitive dice2021-10-05Paper
Some new results on bar visibility of digraphs2021-08-26Paper
On Reconstruction of Graphs From the Multiset of Subgraphs Obtained by Deleting ℓ Vertices2021-07-23Paper
The slow-coloring game on sparse graphs: \(k\)-degenerate, planar, and outerplanar2021-07-23Paper
Acyclic graphs with at least $2\ell+1$ vertices are $\ell$-recognizable2021-03-22Paper
Cut-edges and regular factors in regular graphs of odd degree2021-03-17Paper
3-regular graphs are 2-reconstructible2021-02-08Paper
On-line size Ramsey number for monotone \(k\)-uniform ordered paths with uniform looseness2021-02-08Paper
Upper bounds for bar visibility of subgraphs and \(n\)-vertex graphs2020-06-29Paper
Lichiardopol's conjecture on disjoint cycles in tournaments2020-06-15Paper
https://portal.mardi4nfdi.de/entity/Q51108172020-05-25Paper
Degree lists and connectedness are 3-reconstructible for graphs with at least seven vertices2020-04-30Paper
The Number of Perfect Matchings in M\"obius Ladders and Prisms2020-03-21Paper
Ramsey numbers of interval 2-chromatic ordered graphs2019-11-06Paper
Largest 2-regular subgraphs in 3-regular graphs2019-06-28Paper
Online sum-paintability: slow-coloring of trees2019-05-23Paper
Extremal problems on saturation for the family of $k$-edge-connected graphs2019-05-03Paper
Reconstruction from the deck of ‐vertex induced subgraphs2019-04-25Paper
The unit acquisition number of a graph2019-03-22Paper
Extensions of matroid covering and packing2018-12-20Paper
Antipodal edge-colorings of hypercubes2018-12-05Paper
Randomly twisted hypercubes2018-04-25Paper
Online sum-paintability: the slow-coloring game2018-02-23Paper
Decomposition of regular hypergraphs2018-01-15Paper
Fractional and circular separation dimension of graphs2017-12-21Paper
The vulnerability of the diameter of the enhanced hypercubes2017-09-12Paper
The Game Saturation Number of a Graph2017-07-05Paper
Uniquely Cycle‐Saturated Graphs2017-06-30Paper
Bar visibility numbers for hypercubes and outerplanar digraphs2017-06-29Paper
Degree-associated reconstruction parameters of complete multipartite graphs and their complements2017-03-09Paper
An introduction to the discharging method via graph coloring2017-02-06Paper
Minimum Degree and Dominating Paths2017-02-01Paper
Circular chromatic Ramsey number2017-01-10Paper
Decomposition of sparse graphs into forests: the nine dragon tree conjecture for \(k \leq 2\)2016-11-25Paper
Coloring, sparseness and girth2016-09-15Paper
Reconstruction from $k$-decks for graphs with maximum degree 22016-09-01Paper
A new proof that 4-connected planar graphs are Hamiltonian-connected2016-07-13Paper
Rainbow spanning subgraphs of small diameter in edge-colored complete graphs2016-06-13Paper
Cubic graphs with large ratio of independent domination number to domination number2016-06-13Paper
Anti-Ramsey Problems for t Edge-Disjoint Rainbow Spanning Subgraphs: Cycles, Matchings, or Trees2016-06-10Paper
On \(r\)-dynamic coloring of graphs2016-05-02Paper
To catch a falling robber2016-04-01Paper
Extremal problems for degree-based topological indices2016-03-18Paper
Ordered Ramsey theory and track representations of graphs2015-11-10Paper
https://portal.mardi4nfdi.de/entity/Q29511402015-10-09Paper
Sum-paintability of generalized theta-graphs2015-09-24Paper
The adversary degree-associated reconstruction number of double-brooms2015-08-18Paper
Sharp bounds for the Chinese postman problem in 3-regular graphs and multigraphs2015-07-06Paper
Sharp lower bounds on the fractional matching number2015-05-22Paper
On \(r\)-dynamic coloring of grids2015-05-22Paper
The \(1,2,3\)-conjecture and \(1,2\)-conjecture for sparse graphs2014-11-18Paper
Linear discrepancy of chain products and posets with bounded degree2014-10-31Paper
Beyond Ohba's conjecture: a bound on the choice number of \(k\)-chromatic graphs with \(n\) vertices2014-10-08Paper
Equicovering subgraphs of graphs and hypergraphs2014-09-04Paper
Permutation bigraphs and interval containments2014-08-26Paper
Extensions to 2-factors in bipartite graphs2014-08-14Paper
Cutwidth of triangular grids2014-08-08Paper
Circular \((5,2)\)-coloring of sparse graphs2014-06-13Paper
Decomposition of Cartesian products of regular graphs into isomorphic trees2014-05-13Paper
Three topics in online list coloring2014-04-30Paper
Game matching number of graphs2014-04-22Paper
Acquisition-extremal graphs2014-04-16Paper
Total Acquisition in Graphs2014-04-10Paper
Extremal Problems for Game Domination Number2014-04-10Paper
https://portal.mardi4nfdi.de/entity/Q54055042014-04-02Paper
Visibility Number of Directed Graphs2014-01-21Paper
Rainbow edge-coloring and rainbow domination2013-12-06Paper
Bounds on the \(k\)-dimension of products of special posets2013-11-22Paper
Decomposition of Sparse Graphs into Forests and a Graph with Bounded Degree2013-11-15Paper
Extremal Graphs With a Given Number of Perfect Matchings2013-07-31Paper
Multicolor on-line degree Ramsey numbers of trees2013-07-12Paper
Chain-making games in grid-like posets2013-06-25Paper
Revolutionaries and spies on trees and unicyclic graphs2013-02-28Paper
Revolutionaries and spies: spy-good and spy-bad graphs2013-01-07Paper
Locating a robber on a graph via distance queries2013-01-07Paper
Uniquely \(C _{4}\)-saturated graphs2012-12-27Paper
Degree Ramsey numbers for cycles and blowups of trees2012-12-03Paper
https://portal.mardi4nfdi.de/entity/Q31660022012-10-21Paper
Spanning Cycles Through Specified Edges in Bipartite Graphs2012-09-12Paper
The A4-structure of a graph2012-09-12Paper
Cycle spectra of Hamiltonian graphs2012-08-14Paper
Overlap number of graphs2012-06-04Paper
Packing of graphic n-tuples2012-06-04Paper
Degree Ramsey Numbers of Graphs2012-05-14Paper
Length thresholds for graphic lists given fixed largest and smallest entries and bounded gaps2012-04-30Paper
Packing of Steiner trees and \(S\)-connectors in graphs2012-03-19Paper
A new proof of 3-colorability of Eulerian triangulations2012-03-07Paper
Connected domination number of a graph and its complement2012-01-24Paper
Problems and Solutions2011-12-28Paper
Longest cycles in \(k\)-connected graphs with given independence number2011-12-08Paper
Problems and Solutions2011-11-21Paper
A short proof of the Berge-Tutte formula and the Gallai-Edmonds structure theorem2011-10-24Paper
On-line Ramsey theory for bounded degree graphs2011-07-15Paper
https://portal.mardi4nfdi.de/entity/Q30155902011-07-13Paper
Acyclic sets in \(k\)-majority tournaments2011-06-24Paper
Equitable hypergraph orientations2011-06-01Paper
Matching and edge-connectivity in regular graphs2011-01-07Paper
The edge-count criterion for graphic lists2010-12-16Paper
Balloons, cut-edges, matchings, and total domination in regular graphs of odd degree2010-11-10Paper
Forbidden subposets for fractional weak discrepancy at most \(k\)2010-10-22Paper
Degree-associated reconstruction number of graphs2010-10-18Paper
On the Pagenumber of k-Trees2010-08-27Paper
Matching Extendability in Hypercubes2010-08-27Paper
Extremal Problems for Roman Domination2010-08-27Paper
Rainbow matching in edge-colored graphs2010-06-16Paper
The hub number of a graph2010-06-09Paper
Classes of 3-Regular Graphs That Are (7, 2)-Edge-Choosable2010-06-01Paper
Decomposition of sparse graphs, with application to game coloring number2010-05-05Paper
A short constructive proof of the Erdős-Gallai characterization of graphic lists2010-04-27Paper
Oriented diameter of graphs with diameter 32010-04-21Paper
Chromatic number for a generalization of Cartesian product graphs2010-03-26Paper
Optimal strong parity edge-coloring of complete graphs2009-12-28Paper
Long Local Searches for Maximal Bipartite Subgraphs2009-08-20Paper
Triangle-free planar graphs with minimum degree 3 have radius at least 32009-06-23Paper
Proper path‐factors and interval edge‐coloring of (3,4)‐biregular bigraphs2009-06-16Paper
Implications among linkage properties in graphs2009-06-16Paper
Duality for semiantichains and unichain coverings in products of special posets2009-04-24Paper
Tree-thickness and caterpillar-thickness under girth constraints2009-04-07Paper
Repetition number of graphs2009-04-07Paper
Independence number of 2-factor-plus-triangles graphs2009-04-07Paper
Circular chromatic index of Cartesian products of graphs2008-11-19Paper
Pebbling and optimal pebbling in graphs2008-03-20Paper
https://portal.mardi4nfdi.de/entity/Q54432012008-02-20Paper
https://portal.mardi4nfdi.de/entity/Q54432472008-02-20Paper
Research problems from the 20th British Combinatorial Conference2008-02-14Paper
Short proofs for cut-and-paste sorting of permutations2007-11-27Paper
Improved bounds on families under \(k\)-wise set-intersection constraints2007-10-11Paper
Editorial Announcement: Hello, World2007-09-21Paper
Research problems from the 5th Slovenian Conference (Bled, 2003)2007-02-13Paper
Chvátal's Condition cannot hold for both a graph and its complement2006-10-16Paper
Extending precolorings to circular colorings2006-07-12Paper
Hypergraph extension of the Alon-Tarsi list coloring theorem2006-01-26Paper
Nordhaus–Gaddum‐type Theorems for decompositions into many parts2005-12-08Paper
https://portal.mardi4nfdi.de/entity/Q57085872005-11-18Paper
https://portal.mardi4nfdi.de/entity/Q57086062005-11-18Paper
The Bar Visibility Number of a Graph2005-09-16Paper
Precoloring Extensions of Brooks' Theorem2005-09-16Paper
https://portal.mardi4nfdi.de/entity/Q53118542005-08-29Paper
On the Erdős–Simonovits–Sós Conjecture about the Anti-Ramsey Number of a Cycle2005-03-08Paper
On pattern Ramsey numbers of graphs2005-01-20Paper
Homomorphisms from sparse graphs with large girth.2004-03-15Paper
Probabilistic methods for decomposition dimension of graphs2004-03-04Paper
Graphic and protographic lists of integers2004-02-05Paper
A list analogue of equitable coloring2004-02-03Paper
Interval numbers of powers of block graphs2004-02-02Paper
Edge-colorings of complete graphs that avoid polychromatic trees2004-01-26Paper
Maximum face-constrained coloring of plane graphs2004-01-26Paper
Isometric cycles, cutsets, and crowning of bridged graphs2003-07-31Paper
Ramsey theory and bandwidth of graphs2003-05-11Paper
On the existence of Hamiltonian paths in the cover graph of \(M\)(\(n\))2003-04-28Paper
On restricted edge-colorings of bicliques2002-12-02Paper
The chromatic spectrum of mixed hypergraphs2002-07-29Paper
On the number of vertices with specified eccentricity2002-07-22Paper
Trifold arrangements and cevian dissections2002-06-26Paper
A Fibonacci tiling of the plane2002-05-28Paper
A proof of the two-path conjecture2002-04-25Paper
Realizing degree imbalances in directed graphs2002-03-29Paper
Structural Diagnosis of Wiring Networks: Finding Connected Components of Unknown Subgraphs2001-11-11Paper
https://portal.mardi4nfdi.de/entity/Q27413432001-09-23Paper
https://portal.mardi4nfdi.de/entity/Q45183342001-06-21Paper
https://portal.mardi4nfdi.de/entity/Q49498482001-02-20Paper
Multiple vertex coverings by specified induced subgraphs2001-02-18Paper
https://portal.mardi4nfdi.de/entity/Q43906562000-11-26Paper
Line digraphs and coreflexive vertex sets2000-11-02Paper
Bandwidth and density for block graphs2000-11-02Paper
Connected Domination and Spanning Trees with Many Leaves2000-07-20Paper
https://portal.mardi4nfdi.de/entity/Q44892192000-07-09Paper
https://portal.mardi4nfdi.de/entity/Q47193252000-07-05Paper
Perfection thickness of graphs2000-05-07Paper
Edge-Bandwidth of Graphs2000-04-10Paper
A short proof that `proper = unit'2000-03-21Paper
A note on generalized chromatic number and generalized girth2000-03-21Paper
Intersection representation of digraphs in trees with few leaves2000-02-15Paper
Diagnosis of Wiring Networks: An Optimal Randomized Algorithm for Finding Connected Components of Unknown Graphs1999-10-28Paper
https://portal.mardi4nfdi.de/entity/Q42429651999-10-11Paper
The Bricklayer Problem and the Strong Cycle Lemma1999-09-09Paper
The leafage of a chordal graph1999-05-09Paper
https://portal.mardi4nfdi.de/entity/Q43906871998-08-10Paper
The number of dependent arcs in an acyclic orientation1998-08-10Paper
https://portal.mardi4nfdi.de/entity/Q38381861998-08-09Paper
Short proofs for interval digraphs1998-03-08Paper
https://portal.mardi4nfdi.de/entity/Q43375071997-10-26Paper
Large \(2P_ 3\)-free graphs with bounded degree1996-11-21Paper
The superregular graphs1996-11-12Paper
https://portal.mardi4nfdi.de/entity/Q48710391996-08-13Paper
The Total Interval Number of a Graph II: Trees and Complexity1996-07-29Paper
https://portal.mardi4nfdi.de/entity/Q48710871996-05-21Paper
Representing digraphs using intervals or circular arcs1996-03-24Paper
https://portal.mardi4nfdi.de/entity/Q48695401996-03-11Paper
Gray code enumeration of families of integer partitions1995-11-09Paper
Interval number of special posets and random posets1995-09-17Paper
The 2‐intersection number of paths and bounded‐degree trees1995-08-16Paper
Maximum Bandwidth Under Edge Addition1995-08-13Paper
Size, chromatic number, and connectivity1995-08-06Paper
A Graph-Theoretic Game and Its Application to the k-Server Problem1995-07-03Paper
Acyclic orientations of complete bipartite graphs1995-04-17Paper
The \(p\)-intersection number of a complete bipartite graph and orthogonal double coverings of a clique1995-02-01Paper
Covering a poset by interval orders1994-11-17Paper
https://portal.mardi4nfdi.de/entity/Q43044031994-09-12Paper
https://portal.mardi4nfdi.de/entity/Q31382931994-06-22Paper
Generating linear extensions by adjacent transpositions1994-05-24Paper
Relaxed chromatic numbers of graphs1994-05-10Paper
Large P4‐free graphs with bounded degree1994-03-13Paper
Subtree and substar intersection numbers1994-02-24Paper
The total interval number of a graph. I: Fundamental classes1993-10-17Paper
Clique coverings of the edges of a random graph1993-08-16Paper
Large regular graphs with no induced \(2K_ 2\)1993-01-16Paper
https://portal.mardi4nfdi.de/entity/Q40103051992-09-27Paper
The maximum number of winning 2-sets1992-06-28Paper
Adding up to Powers1992-06-26Paper
The interval inclusion number of a partially ordered set1992-06-25Paper
Spanning Trees with Many Leaves1991-01-01Paper
Wide posets with fixed height and cutset number1990-01-01Paper
Tetrahedrizing point sets in three dimensions1990-01-01Paper
A short proof of the degree bound for interval number1989-01-01Paper
A length-width inequality for partially ordered sets with two-element cutsets1989-01-01Paper
https://portal.mardi4nfdi.de/entity/Q32045031989-01-01Paper
The addition game: An abstraction of a communication problem1988-01-01Paper
Eigensharp Graphs: Decomposition into Complete Bipartite Subgraphs1988-01-01Paper
Pagenumber of complete bipartite graphs1988-01-01Paper
Two easy duality theorems for product partial orders1987-01-01Paper
Unichain coverings in partial orders with the nested saturation property1987-01-01Paper
Regressions and monotone chains. II: the poset of integer intervals1987-01-01Paper
Sorting by insertion of leading elements1987-01-01Paper
Poset boxicity of graphs1987-01-01Paper
An improved edge bound on the interval number of a graph1987-01-01Paper
The Borsuk-Ulam Theorem and Bisection of Necklaces1986-01-01Paper
``Poly-unsaturated posets: The Greene-Kleitman theorem is best possible1986-01-01Paper
Networks and chain coverings in partial orders and their products1985-01-01Paper
A note on the interval number of a graph1985-01-01Paper
Decomposition of product graphs into complete bipartite subgraphs1985-01-01Paper
Bisection of Circle Colorings1985-01-01Paper
https://portal.mardi4nfdi.de/entity/Q36841571985-01-01Paper
https://portal.mardi4nfdi.de/entity/Q36917741985-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37739211985-01-01Paper
Recognizing graphs with fixed interval number is NP-complete1984-01-01Paper
The interval number of a complete multipartite graph1984-01-01Paper
Regressions and monotone chains: A Ramsey-type extremal problem for partial orders1984-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37141051984-01-01Paper
The interval number of a planar graph: Three intervals suffice1983-01-01Paper
Some remarks on normalized matching1983-01-01Paper
A class of solutions to the gossip problem. III1982-01-01Paper
A class of solutions to the gossip problem. I1982-01-01Paper
A class of solutions to the gossip problem. II1982-01-01Paper
Gossiping without Duplicate Transmissions1982-01-01Paper
https://portal.mardi4nfdi.de/entity/Q39645691982-01-01Paper
Semiantichains and Unichain Coverings in Direct Products of Partial Orders1981-01-01Paper
A symmetric chain decomposition of L(4,n)1980-01-01Paper
Extremal Values of the Interval Number of a Graph1980-01-01Paper
The number of meets between two subsets of a lattice1979-01-01Paper
Skew chain orders and sets of rectangles1979-01-01Paper
Pairs of Adjacent Hamiltonian Circuits with Small Intersection1978-01-01Paper

Research outcomes over time


Doctoral students

No records found.


Known relations from the MaRDI Knowledge Graph

PropertyValue
MaRDI profile typeMaRDI person profile
instance ofhuman


This page was built for person: Douglas B. West