The following pages link to Douglas B. West (Q185079):
Displaying 50 items.
- Oriented diameter of graphs with diameter 3 (Q965254) (← links)
- A short constructive proof of the Erdős-Gallai characterization of graphic lists (Q965964) (← links)
- Decomposition of sparse graphs, with application to game coloring number (Q968426) (← links)
- The hub number of a graph (Q975457) (← links)
- Rainbow matching in edge-colored graphs (Q976680) (← links)
- Tree-thickness and caterpillar-thickness under girth constraints (Q1010820) (← links)
- Repetition number of graphs (Q1010910) (← links)
- Independence number of 2-factor-plus-triangles graphs (Q1010933) (← links)
- Duality for semiantichains and unichain coverings in products of special posets (Q1013994) (← links)
- Optimal strong parity edge-coloring of complete graphs (Q1046737) (← links)
- Networks and chain coverings in partial orders and their products (Q1059648) (← links)
- A note on the interval number of a graph (Q1065014) (← links)
- ``Poly-unsaturated'' posets: The Greene-Kleitman theorem is best possible (Q1069961) (← links)
- Decomposition of product graphs into complete bipartite subgraphs (Q1073047) (← links)
- Unichain coverings in partial orders with the nested saturation property (Q1086262) (← links)
- Regressions and monotone chains. II: the poset of integer intervals (Q1090686) (← links)
- Sorting by insertion of leading elements (Q1096394) (← links)
- The addition game: An abstraction of a communication problem (Q1097184) (← links)
- Poset boxicity of graphs (Q1103652) (← links)
- A short proof of the degree bound for interval number (Q1114708) (← links)
- A length-width inequality for partially ordered sets with two-element cutsets (Q1124616) (← links)
- The number of meets between two subsets of a lattice (Q1132900) (← links)
- A symmetric chain decomposition of L(4,n) (Q1146199) (← links)
- A class of solutions to the gossip problem. I (Q1170198) (← links)
- A class of solutions to the gossip problem. II (Q1170199) (← links)
- The interval inclusion number of a partially ordered set (Q1176729) (← links)
- The maximum number of winning 2-sets (Q1182325) (← links)
- Large regular graphs with no induced \(2K_ 2\) (Q1196569) (← links)
- Skew chain orders and sets of rectangles (Q1258741) (← links)
- A short proof that `proper = unit' (Q1301726) (← links)
- Relaxed chromatic numbers of graphs (Q1323496) (← links)
- Covering a poset by interval orders (Q1323838) (← links)
- Generating linear extensions by adjacent transpositions (Q1325273) (← links)
- Size, chromatic number, and connectivity (Q1340118) (← links)
- The \(p\)-intersection number of a complete bipartite graph and orthogonal double coverings of a clique (Q1343169) (← links)
- Short proofs for interval digraphs (Q1377823) (← links)
- The number of dependent arcs in an acyclic orientation (Q1386477) (← links)
- Interval numbers of powers of block graphs (Q1420587) (← links)
- Edge-colorings of complete graphs that avoid polychromatic trees (Q1421517) (← links)
- Maximum face-constrained coloring of plane graphs (Q1421525) (← links)
- Graphic and protographic lists of integers (Q1422142) (← links)
- Probabilistic methods for decomposition dimension of graphs (Q1423494) (← links)
- Homomorphisms from sparse graphs with large girth. (Q1425115) (← links)
- Line digraphs and coreflexive vertex sets (Q1584342) (← links)
- Bandwidth and density for block graphs (Q1584358) (← links)
- A Fibonacci tiling of the plane (Q1598848) (← links)
- Trifold arrangements and cevian dissections (Q1601380) (← links)
- The chromatic spectrum of mixed hypergraphs (Q1606033) (← links)
- Antipodal edge-colorings of hypercubes (Q1630942) (← links)
- Extensions of matroid covering and packing (Q1633609) (← links)
