Year |
Citation |
Score |
2020 |
Ma F, West DB, Yan J. Lichiardopol’s Conjecture on Disjoint Cycles in Tournaments The Electronic Journal of Combinatorics. 27. DOI: 10.37236/7715 |
0.347 |
|
2020 |
Kostochka A, West DB. On reconstruction of n-vertex graphs from the multiset of (n – ℓ)-vertex induced subgraphs Ieee Transactions On Information Theory. 1-1. DOI: 10.1109/Tit.2020.2983678 |
0.527 |
|
2020 |
Feng Y, West DB, Yang Y. Upper bounds for bar visibility of subgraphs and n-vertex graphs Discrete Applied Mathematics. 283: 272-274. DOI: 10.1016/J.Dam.2020.01.011 |
0.59 |
|
2020 |
Joyce S, Schaefer A, West DB, Zaslavsky T. Strongly connectable digraphs and non-transitive dice Akce International Journal of Graphs and Combinatorics. 17: 480-485. DOI: 10.1016/J.Akcej.2019.03.011 |
0.465 |
|
2020 |
Kostochka AV, Nahvi M, West DB, Zirlin D. Degree Lists and Connectedness are 3-Reconstructible for Graphs with At Least Seven Vertices Graphs and Combinatorics. 36: 491-501. DOI: 10.1007/S00373-020-02131-6 |
0.585 |
|
2019 |
West DB, Wise JI. Antipodal Edge-Colorings of Hypercubes Discussiones Mathematicae Graph Theory. 39: 271-284. DOI: 10.7151/Dmgt.2055 |
0.397 |
|
2019 |
Fan G, Jiang H, Li P, West DB, Yang D, Zhu X. Extensions of matroid covering and packing European Journal of Combinatorics. 76: 117-122. DOI: 10.1016/J.Ejc.2018.09.010 |
0.325 |
|
2019 |
Puleo GJ, West DB. Online Sum-Paintability: Slow-Coloring of Trees Discrete Applied Mathematics. 262: 158-168. DOI: 10.1016/J.Dam.2019.02.003 |
0.531 |
|
2019 |
Lei H, O S, Shi Y, West DB, Zhu X. Extremal problems on saturation for the family of k-edge-connected graphs Discrete Applied Mathematics. 260: 278-283. DOI: 10.1016/J.Dam.2019.01.009 |
0.492 |
|
2019 |
Johnson F, Raleigh A, Wenger PS, West DB. The unit acquisition number of a graph Discrete Applied Mathematics. 258: 166-176. DOI: 10.1016/J.Dam.2018.11.007 |
0.843 |
|
2019 |
Neidinger D, West DB. Ramsey Numbers of Interval 2-Chromatic Ordered Graphs Graphs and Combinatorics. 35: 1065-1076. DOI: 10.1007/S00373-019-02057-8 |
0.609 |
|
2019 |
Choi I, Kim R, Kostochka AV, Park B, West DB. Largest 2-Regular Subgraphs in 3-Regular Graphs Graphs and Combinatorics. 35: 805-813. DOI: 10.1007/S00373-019-02021-6 |
0.629 |
|
2018 |
Choi JO, West DB. Decomposition of regular hypergraphs The Journal of Combinatorics. 9: 21-33. DOI: 10.4310/Joc.2018.V9.N1.A3 |
0.564 |
|
2018 |
Dudek A, Pérez-Giménez X, Pralat P, Qi H, West DB, Zhu X. Randomly twisted hypercubes European Journal of Combinatorics. 70: 364-373. DOI: 10.1016/J.Ejc.2018.01.013 |
0.425 |
|
2018 |
Loeb SJ, West DB. Fractional and Circular Separation Dimension of Graphs European Journal of Combinatorics. 69: 19-35. DOI: 10.1016/J.Ejc.2017.09.001 |
0.572 |
|
2018 |
Mahoney T, Puleo GJ, West DB. Online sum-paintability: The slow-coloring game Discrete Mathematics. 341: 1084-1093. DOI: 10.1016/J.Disc.2018.01.001 |
0.566 |
|
2017 |
Jao KF, Tardif C, West DB, Zhu X. Circular chromatic Ramsey number The Journal of Combinatorics. 8: 189-208. DOI: 10.4310/Joc.2017.V8.N1.A7 |
0.307 |
|
2017 |
Ma M, West DB, Xu J. The vulnerability of the diameter of the enhanced hypercubes Theoretical Computer Science. 694: 60-65. DOI: 10.1016/J.Tcs.2017.07.005 |
0.462 |
|
2017 |
Chen M, Kim SJ, Kostochka AV, West DB, Zhu X. Decomposition of Sparse Graphs into Forests: The Nine Dragon Tree Conjecture for k ≤ 2 Journal of Combinatorial Theory, Series B. 122: 741-756. DOI: 10.1016/J.Jctb.2016.09.004 |
0.555 |
|
2017 |
Cranston DW, West DB. An introduction to the discharging method via graph coloring Discrete Mathematics. 340: 766-793. DOI: 10.1016/J.Disc.2016.11.022 |
0.691 |
|
2017 |
West DB, Wise JI. Bar Visibility Numbers for Hypercubes and Outerplanar Digraphs Graphs and Combinatorics. 33: 221-231. DOI: 10.1007/S00373-016-1745-4 |
0.61 |
|
2017 |
Wenger PS, West DB. Uniquely Cycle‐Saturated Graphs Journal of Graph Theory. 85: 94-106. DOI: 10.1002/Jgt.22049 |
0.827 |
|
2016 |
Xiaoyun L, West DB. A new proof that 4-connected planar graphs are hamiltonian-connected Discussiones Mathematicae - Graph Theory. 36: 555-564. DOI: 10.7151/Dmgt.1872 |
0.529 |
|
2016 |
Alon N, Kostochka A, Reiniger B, West DB, Zhu X. Coloring, sparseness and girth Israel Journal of Mathematics. 214: 315-331. DOI: 10.1007/S11856-016-1361-2 |
0.602 |
|
2016 |
Carraher JM, Kinnersley WB, Reiniger B, West DB. The Game Saturation Number of a Graph Journal of Graph Theory. DOI: 10.1002/Jgt.22074 |
0.521 |
|
2016 |
Faudree RJ, Gould RJ, Jacobson MS, West DB. Minimum degree and dominating paths Journal of Graph Theory. DOI: 10.1002/Jgt.22021 |
0.591 |
|
2015 |
Milans KG, Stolee D, West DB. Ordered Ramsey theory and track representations of graphs The Journal of Combinatorics. 6: 445-456. DOI: 10.4310/Joc.2015.V6.N4.A3 |
0.831 |
|
2015 |
Kinnersley WB, Prałat P, West DB. To catch a falling robber Theoretical Computer Science. DOI: 10.1016/J.Tcs.2016.02.030 |
0.368 |
|
2015 |
Ma M, Shi H, West DB. The adversary degree-associated reconstruction number of double-brooms Journal of Discrete Algorithms. 33: 150-159. DOI: 10.1016/J.Jda.2015.03.008 |
0.375 |
|
2015 |
Noel JA, West DB, Wu H, Zhu X. Beyond Ohba's Conjecture: A bound on the choice number of k-chromatic graphs with n vertices European Journal of Combinatorics. 43: 295-305. DOI: 10.1016/J.Ejc.2014.08.032 |
0.561 |
|
2015 |
Tang Y, West DB, Zhou B. Extremal problems for degree-based topological indices Discrete Applied Mathematics. DOI: 10.1016/J.Dam.2015.09.011 |
0.501 |
|
2015 |
Suil O, West DB. Sharp bounds for the Chinese Postman Problem in 3-regular graphs and multigraphs Discrete Applied Mathematics. 190: 163-168. DOI: 10.1016/J.Dam.2015.03.017 |
0.468 |
|
2015 |
Kang R, Müller T, West DB. On r-dynamic coloring of grids Discrete Applied Mathematics. 186: 286-290. DOI: 10.1016/J.Dam.2015.01.020 |
0.532 |
|
2015 |
Behrend RE, Suil O, West DB. Sharp lower bounds on the fractional matching number Discrete Applied Mathematics. 186: 272-274. DOI: 10.1016/J.Dam.2015.01.014 |
0.503 |
|
2015 |
Jahanbekam S, West DB. Rainbow Spanning Subgraphs of Small Diameter in Edge-Colored Complete Graphs Graphs and Combinatorics. DOI: 10.1007/S00373-015-1588-4 |
0.426 |
|
2015 |
O S, West DB. Cubic Graphs with Large Ratio of Independent Domination Number to Domination Number Graphs and Combinatorics. DOI: 10.1007/S00373-015-1580-Z |
0.588 |
|
2015 |
Jahanbekam S, West DB. Anti-Ramsey Problems for t Edge-Disjoint Rainbow Spanning Subgraphs: Cycles, Matchings, or Trees Journal of Graph Theory. DOI: 10.1002/Jgt.21888 |
0.516 |
|
2014 |
Cranston DW, Jahanbekam S, West DB. The 1, 2, 3-conjecture and 1, 2-conjecture for sparse graphs Discussiones Mathematicae - Graph Theory. 34: 769-799. DOI: 10.7151/Dmgt.1768 |
0.734 |
|
2014 |
Carraher J, Loeb S, Mahoney T, Puleo GJ, Tsai M, West DB. Three Topics in Online List Coloring The Journal of Combinatorics. 5: 115-130. DOI: 10.4310/Joc.2014.V5.N1.A5 |
0.581 |
|
2014 |
Choi I, Kim J, Tebbe A, West DB. Equicovering Subgraphs of Graphs and Hypergraphs Electronic Journal of Combinatorics. 21: 1-62. DOI: 10.37236/3999 |
0.43 |
|
2014 |
Lin L, Lin Y, West DB. Cutwidth of triangular grids Discrete Mathematics. 331: 89-92. DOI: 10.1016/J.Disc.2014.04.029 |
0.561 |
|
2014 |
Jahanbekam S, Kim J, O S, West DB. On r-dynamic coloring of graphs Discrete Applied Mathematics. DOI: 10.1016/J.Dam.2016.01.016 |
0.539 |
|
2014 |
Saha PK, Basu A, Sen MK, West DB. Permutation bigraphs and interval containments Discrete Applied Mathematics. 175: 71-78. DOI: 10.1016/J.Dam.2014.05.020 |
0.37 |
|
2014 |
Choi JO, Milans KG, West DB. Linear Discrepancy of Chain Products and Posets with Bounded Degree Order. 31: 291-305. DOI: 10.1007/S11083-013-9302-8 |
0.784 |
|
2014 |
Carraher JM, Mahoney T, Puleo GJ, West DB. Sum-Paintability of Generalized Theta-Graphs Graphs and Combinatorics. 31: 1325-1334. DOI: 10.1007/S00373-014-1441-1 |
0.541 |
|
2013 |
Jao KF, Kostochka AV, West DB. Decomposition of cartesian products of regular graphs into isomorphic trees The Journal of Combinatorics. 4: 469-490. DOI: 10.4310/Joc.2013.V4.N4.A6 |
0.56 |
|
2013 |
Vandenbussche J, West DB. Extensions to 2-factors in bipartite graphs Electronic Journal of Combinatorics. 20. DOI: 10.37236/3594 |
0.558 |
|
2013 |
Kinnersley WB, West DB, Zamani R. Extremal problems for game domination number Siam Journal On Discrete Mathematics. 27: 2090-2107. DOI: 10.1137/120884742 |
0.563 |
|
2013 |
Axenovich M, Beveridge A, Hutchinson JP, West DB. Visibility number of directed graphs Siam Journal On Discrete Mathematics. 27: 1429-1449. DOI: 10.1137/120864234 |
0.59 |
|
2013 |
Lesaulnier TD, Prince N, Wenger PS, West DB, Worah P. Total acquisition in graphs Siam Journal On Discrete Mathematics. 27: 1800-1819. DOI: 10.1137/110856186 |
0.833 |
|
2013 |
Jiang T, Milans KG, West DB. Degree Ramsey numbers for cycles and blowups of trees European Journal of Combinatorics. 34: 414-423. DOI: 10.1016/J.Ejc.2012.08.004 |
0.836 |
|
2013 |
LeSaulnier TD, West DB. Rainbow edge-coloring and rainbow domination Discrete Mathematics. 313: 2020-2025. DOI: 10.1016/J.Disc.2012.03.014 |
0.861 |
|
2013 |
Cranston DW, Kinnersley WB, Suil O, West DB. Game matching number of graphs Discrete Applied Mathematics. 161: 1828-1836. DOI: 10.1016/J.Dam.2013.03.010 |
0.764 |
|
2013 |
Lesaulnier TD, West DB. Acquisition-extremal graphs Discrete Applied Mathematics. 161: 1521-1529. DOI: 10.1016/J.Dam.2012.12.014 |
0.849 |
|
2013 |
Baym M, West DB. Bounds on the k-dimension of Products of Special Posets Order. 30: 779-796. DOI: 10.1007/S11083-012-9276-Y |
0.404 |
|
2013 |
Kim SJ, Kostochka AV, West DB, Wu H, Zhu X. Decomposition of Sparse Graphs into Forests and a Graph with Bounded Degree Journal of Graph Theory. 74: 369-391. DOI: 10.1002/Jgt.21711 |
0.565 |
|
2013 |
Hartke SG, Stolee D, West DB, Yancey M. Extremal graphs with a given number of perfect matchings Journal of Graph Theory. 73: 449-468. DOI: 10.1002/Jgt.21687 |
0.469 |
|
2012 |
Cranston DW, Kinnersley WB, Milans KG, Puleo GJ, West DB. Chain-making games in grid-like posets The Journal of Combinatorics. 3: 633-649. DOI: 10.4310/Joc.2012.V3.N4.A3 |
0.767 |
|
2012 |
Cranston DW, Smyth CD, West DB. Revolutionaries and spies on trees and unicyclic graphs The Journal of Combinatorics. 3: 195-205. DOI: 10.4310/Joc.2012.V3.N2.A4 |
0.786 |
|
2012 |
Kinnersley WB, West DB. Multicolor on-line degree Ramsey numbers of trees The Journal of Combinatorics. 3: 91-100. DOI: 10.4310/Joc.2012.V3.N1.A4 |
0.61 |
|
2012 |
Kinnersley WB, Milans KG, West DB. Degree ramsey numbers of graphs Combinatorics Probability and Computing. 21: 229-253. DOI: 10.1017/S0963548311000617 |
0.797 |
|
2012 |
Carraher J, Choi I, Delcourt M, Erickson LH, West DB. Locating a robber on a graph via distance queries Theoretical Computer Science. 463: 54-61. DOI: 10.1016/J.Tcs.2012.06.035 |
0.616 |
|
2012 |
Butterfield JV, Cranston DW, Puleo GJ, West DB, Zamani R. Revolutionaries and spies: Spy-good and spy-bad graphs Theoretical Computer Science. 463: 35-53. DOI: 10.1016/J.Tcs.2012.05.041 |
0.712 |
|
2012 |
Milans KG, Pfender F, Rautenbach D, Regen F, West DB. Cycle spectra of Hamiltonian graphs Journal of Combinatorial Theory. Series B. 102: 869-874. DOI: 10.1016/J.Jctb.2012.04.002 |
0.814 |
|
2012 |
West DB, Wu H. Packing of Steiner trees and S-connectors in graphs Journal of Combinatorial Theory. Series B. 102: 186-205. DOI: 10.1016/J.Jctb.2011.06.003 |
0.609 |
|
2012 |
Barrus MD, Hartke SG, Jao KF, West DB. Length thresholds for graphic lists given fixed largest and smallest entries and bounded gaps Discrete Mathematics. 312: 1494-1501. DOI: 10.1016/J.Disc.2011.05.001 |
0.777 |
|
2012 |
Cooper J, Lenz J, Le Saulnier TD, Wenger PS, West DB. Uniquely C 4-Saturated Graphs Graphs and Combinatorics. 28: 189-197. DOI: 10.1007/S00373-011-1038-X |
0.847 |
|
2012 |
Karami H, Sheikholeslami SM, Khodkar A, West DB. Connected Domination Number of a Graph and its Complement Graphs and Combinatorics. 28: 123-131. DOI: 10.1007/S00373-011-1028-Z |
0.516 |
|
2012 |
Barrus MD, West DB. The A 4-structure of a graph Journal of Graph Theory. 71: 159-175. DOI: 10.1002/Jgt.20639 |
0.845 |
|
2012 |
Zamani R, West DB. Spanning cycles through specified edges in bipartite graphs Journal of Graph Theory. 71: 1-17. DOI: 10.1002/Jgt.20627 |
0.589 |
|
2012 |
Busch AH, Ferrara MJ, Hartke SG, Jacobson MS, Kaul H, West DB. Packing of graphic n-tuples Journal of Graph Theory. 70: 29-39. DOI: 10.1002/Jgt.20598 |
0.718 |
|
2012 |
Cranston DW, Korula N, Lesaulnier TD, Milans KG, Stocker CJ, Vandenbussche J, West DB. Overlap number of graphs Journal of Graph Theory. 70: 10-28. DOI: 10.1002/Jgt.20596 |
0.835 |
|
2012 |
Jao KF, West DB. Vertex degrees in outerplanar graphs Journal of Combinatorial Mathematics and Combinatorial Computing. 82: 229-239. |
0.445 |
|
2011 |
Butterfield J, Grauman T, Kinnersley WB, Milans KG, Stocker CJ, West DB. On-line Ramsey Theory for Bounded Degree Graphs ∗ Electronic Journal of Combinatorics. 18: 136. DOI: 10.37236/623 |
0.862 |
|
2011 |
Milans KG, Schreiber DH, West DB. Acyclic Sets in $k$-Majority Tournaments Electronic Journal of Combinatorics. 18: 122. DOI: 10.37236/609 |
0.776 |
|
2011 |
Caro Y, West DB, Yuster R. Equitable hypergraph orientations Electronic Journal of Combinatorics. 18: 121. DOI: 10.37236/608 |
0.516 |
|
2011 |
Tsai MT, West DB. A new proof of 3-colorability of eulerian triangulations Ars Mathematica Contemporanea. 4: 73-77. DOI: 10.26493/1855-3974.193.8E7 |
0.475 |
|
2011 |
O S, West DB, Wu H. Longest cycles in k-connected graphs with given independence number Journal of Combinatorial Theory, Series B. 101: 480-485. DOI: 10.1016/J.Jctb.2011.02.005 |
0.607 |
|
2011 |
O S, West DB. Matching and edge-connectivity in regular graphs European Journal of Combinatorics. 32: 324-329. DOI: 10.1016/J.Ejc.2010.10.005 |
0.612 |
|
2011 |
Milans KG, Schreiber DH, West DB. Acyclic sets in k-majority tournaments Electronic Journal of Combinatorics. 18: 1-7. |
0.773 |
|
2010 |
Isaak G, West DB. The Edge-Count Criterion for Graphic Lists Electronic Journal of Combinatorics. 17: 36. DOI: 10.37236/485 |
0.533 |
|
2010 |
LeSaulnier TD, Stocker CJ, Wenger PS, West DB. Rainbow Matching in Edge-Colored Graphs Electronic Journal of Combinatorics. 17: 26. DOI: 10.37236/475 |
0.814 |
|
2010 |
Kwok PK, Liu Q, West DB. Oriented diameter of graphs with diameter 3 Journal of Combinatorial Theory. Series B. 100: 265-274. DOI: 10.1016/J.Jctb.2009.08.003 |
0.517 |
|
2010 |
Choi JO, West DB. Forbidden subposets for fractional weak discrepancy at most k European Journal of Combinatorics. 31: 1957-1963. DOI: 10.1016/J.Ejc.2010.05.004 |
0.529 |
|
2010 |
Barrus MD, West DB. Degree-associated reconstruction number of graphs Discrete Mathematics. 310: 2600-2612. DOI: 10.1016/J.Disc.2010.03.037 |
0.867 |
|
2010 |
Montassier M, Pêcher A, Raspaud A, West DB, Zhu X. Decomposition of sparse graphs, with application to game coloring number Discrete Mathematics. 310: 1520-1523. DOI: 10.1016/J.Disc.2010.01.008 |
0.476 |
|
2010 |
Tripathi A, Venugopalan S, West DB. A short constructive proof of the Erdo{double acute}s-Gallai characterization of graphic lists Discrete Mathematics. 310: 843-844. DOI: 10.1016/J.Disc.2009.09.023 |
0.477 |
|
2010 |
Suil O, West DB. Balloons, cut-edges, matchings, and total domination in regular graphs of odd degree Journal of Graph Theory. 64: 116-131. DOI: 10.1002/Jgt.V64:2 |
0.566 |
|
2009 |
Caro Y, West DB. Repetition number of graphs Electronic Journal of Combinatorics. 16. DOI: 10.37236/96 |
0.65 |
|
2009 |
Kŕal D, West DB. Chromatic number for a generalization of cartesian product graphs Electronic Journal of Combinatorics. 16. DOI: 10.37236/160 |
0.571 |
|
2009 |
Vandenbussche J, West DB. Independence number of 2-faetor-plus-triangles graphs Electronic Journal of Combinatorics. 16. DOI: 10.37236/116 |
0.636 |
|
2009 |
Vandenbussche J, West DB. Matching extendability in hypercubes Siam Journal On Discrete Mathematics. 23: 1539-1547. DOI: 10.1137/080732687 |
0.534 |
|
2009 |
Cranston DW, West DB. Classes of 3-regular graphs that are (7, 2)-edge-choosable Siam Journal On Discrete Mathematics. 23: 872-881. DOI: 10.1137/080716335 |
0.751 |
|
2009 |
Vandenbussche J, West DB, Yu G. On the pagenumber of k-trees Siam Journal On Discrete Mathematics. 23: 1455-1464. DOI: 10.1137/080714208 |
0.536 |
|
2009 |
Chambers EW, Kinnersley B, Prince N, West DB. Extremal Problems for Roman Domination Siam Journal On Discrete Mathematics. 23: 1575-1586. DOI: 10.1137/070699688 |
0.846 |
|
2009 |
Asratian AS, Casselgren CJ, Vandenbussche J, West DB. Proper path-factors and interval edge-coloring of (3,4)-biregular bigraphs Journal of Graph Theory. 61: 88-97. DOI: 10.1002/Jgt.V61:2 |
0.599 |
|
2009 |
Liu Q, West DB, Yu G. Implications among linkage properties in graphs Journal of Graph Theory. 60: 327-337. DOI: 10.1002/Jgt.V60:4 |
0.565 |
|
2008 |
Kim S, West DB. Triangle-free planar graphs with minimum degree 3 have radius at least 3 Discussiones Mathematicae Graph Theory. 28: 563-566. DOI: 10.7151/Dmgt.1428 |
0.653 |
|
2008 |
Liu Q, West DB. Tree-thickness and caterpillar-thickness under girth constraints Electronic Journal of Combinatorics. 15. DOI: 10.37236/817 |
0.623 |
|
2008 |
Kaul H, West DB. Long local searches for maximal bipartite subgraphs Siam Journal On Discrete Mathematics. 22: 1138-1144. DOI: 10.1137/060666615 |
0.712 |
|
2008 |
Grauman T, Hartke SG, Jobson A, Kinnersley B, West DB, Wiglesworth L, Worah P, Wu H. The hub number of a graph Information Processing Letters. 108: 226-228. DOI: 10.1016/J.Ipl.2008.05.022 |
0.585 |
|
2008 |
Liu Q, West DB. Duality for semiantichains and unichain coverings in products of special posets Order. 25: 359-367. DOI: 10.1007/S11083-008-9099-Z |
0.337 |
|
2008 |
Bunde DP, Milans K, West DB, Wu H. Optimal strong parity edge-coloring of complete graphs Combinatorica. 28: 625-632. DOI: 10.1007/S00493-008-2364-3 |
0.835 |
|
2008 |
West DB, Zhu X. Circular chromatic index of cartesian products of graphs Journal of Graph Theory. 57: 7-18. DOI: 10.1002/Jgt.V57:1 |
0.544 |
|
2007 |
Cranston DW, Sudborough IH, West DB. Short proofs for cut-and-paste sorting of permutations Discrete Mathematics. 307: 2866-2870. DOI: 10.1016/J.Disc.2007.01.011 |
0.662 |
|
2007 |
Cao W, Hwang KW, West DB. Improved bounds on families under k-wise set-intersection constraints Graphs and Combinatorics. 23: 381-386. DOI: 10.1007/S00373-007-0741-0 |
0.593 |
|
2006 |
Kostochka AV, West DB. Chvátal's Condition cannot hold for both a graph and its complement Discussiones Mathematicae Graph Theory. 26: 73-76. DOI: 10.7151/Dmgt.1302 |
0.569 |
|
2006 |
Albertson MO, West DB. Extending precolorings to circular colorings Journal of Combinatorial Theory. Series B. 96: 472-481. DOI: 10.1016/J.Jctb.2005.09.010 |
0.481 |
|
2005 |
Ramamurthi R, West DB. Hypergraph extension of the Alon-Tarsi list coloring theorem Combinatorica. 25: 355-366. DOI: 10.1007/S00493-005-0020-8 |
0.692 |
|
2005 |
Füredi Z, Kostochka AV, Škrekovski R, Stiebitz M, West DB. Nordhaus–Gaddum-type Theorems for decompositions into many parts Journal of Graph Theory. 50: 273-292. DOI: 10.1002/Jgt.V50:4 |
0.6 |
|
2004 |
Fon-Der-Flaass D, West DB. Graphic and protographic lists of integers Electronic Journal of Combinatorics. 11. DOI: 10.37236/1757 |
0.367 |
|
2004 |
Chang YW, Hutchinson JP, Jacobson MS, Lehel J, West DB. The bar visibility number of a graph Siam Journal On Discrete Mathematics. 18: 462-471. DOI: 10.1137/S0895480198343455 |
0.613 |
|
2004 |
Albertson MO, Kostochka AV, West DB. Precoloring extensions of Brooks' theorem Siam Journal On Discrete Mathematics. 18: 542-553. DOI: 10.1137/S0895480103425942 |
0.557 |
|
2004 |
Ramamurthi R, West DB. Maximum face-constrained coloring of plane graphs Discrete Mathematics. 274: 233-240. DOI: 10.1016/S1571-0653(04)00100-3 |
0.768 |
|
2004 |
Borodin OV, Kim S-, Kostochka AV, West DB. Homomorphisms from sparse graphs with large girth Journal of Combinatorial Theory, Series B. 90: 147-159. DOI: 10.1016/S0095-8956(03)00081-9 |
0.556 |
|
2004 |
Chen M, Chang GJ, West DB. Interval numbers of powers of block graphs Discrete Mathematics. 275: 87-96. DOI: 10.1016/S0012-365X(03)00098-0 |
0.591 |
|
2004 |
Jiang T, West DB. Edge-colorings of complete graphs that avoid polychromatic trees Discrete Mathematics. 274: 137-145. DOI: 10.1016/J.Disc.2003.09.002 |
0.505 |
|
2004 |
Jamison RE, West DB. On pattern Ramsey numbers of graphs Graphs and Combinatorics. 20: 333-339. DOI: 10.1007/S00373-004-0562-Y |
0.375 |
|
2003 |
Jiang T, West DB. On the Erdos-Simonovits-Sós conjecture about the anti-Ramsey number of a cycle Combinatorics Probability and Computing. 12: 585-598. DOI: 10.1017/S096354830300590X |
0.425 |
|
2003 |
Savage CD, Shields I, West DB. On the existence of Hamiltonian paths in the cover graph of M(n) Discrete Mathematics. 262: 241-252. DOI: 10.1016/S0012-365X(02)00503-4 |
0.437 |
|
2003 |
Hagita M, Kündgen A, West DB. Probabilistic Methods for Decomposition Dimension of Graphs Graphs and Combinatorics. 19: 493-503. DOI: 10.1007/S00373-003-0526-Z |
0.626 |
|
2003 |
Kostochka AV, Pelsmajer MJ, West DB. A List Analogue of Equitable Coloring Journal of Graph Theory. 44: 166-177. DOI: 10.1002/Jgt.V44:3 |
0.818 |
|
2003 |
Jiang T, Kim SJ, West DB. Isometric cycles, cutsets, and crowning of bridged graphs Journal of Graph Theory. 43: 161-170. DOI: 10.1002/Jgt.V43:3 |
0.6 |
|
2002 |
Fleischner H, Molina RR, Smith KW, West DB. A Proof of the Two-path Conjecture Electronic Journal of Combinatorics. 9: 4. DOI: 10.37236/1665 |
0.625 |
|
2002 |
Ramamurthi R, West DB. Maximum Face-Constrained Coloring of Plane Graphs1 1 Written August, 2000. Revised July, 2001 Electronic Notes in Discrete Mathematics. 11: 542-549. DOI: 10.1016/S1571-0653(04)00100-3 |
0.717 |
|
2002 |
Jiang T, West DB. Edge-Colorings of Complete Graphs that Avoid Polychromatic Trees1 1 Written August, 2000. Revised July, 2001 Electronic Notes in Discrete Mathematics. 11: 376-385. DOI: 10.1016/S1571-0653(04)00082-4 |
0.524 |
|
2002 |
Mubayi D, West DB. On restricted edge-colorings of bicliques Discrete Mathematics. 257: 513-529. DOI: 10.1016/S0012-365X(02)00510-1 |
0.653 |
|
2002 |
Jiang T, Mubayi D, Tuza Z, Voloshin V, West DB. The chromatic spectrum of mixed hypergraphs Graphs and Combinatorics. 18: 309-318. DOI: 10.1007/S003730200023 |
0.635 |
|
2001 |
Shi W, West DB. Structural diagnosis of wiring networks: Finding connected components of unknown subgraphs Siam Journal On Discrete Mathematics. 14: 510-523. DOI: 10.1137/S0895480100371286 |
0.437 |
|
2001 |
Mubayi D, Will TG, West DB. Realizing degree imbalances in directed graphs Discrete Mathematics. 239: 147-153. DOI: 10.1016/S0012-365X(01)00048-6 |
0.686 |
|
2001 |
Füredi Z, West DB. Ramsey theory and bandwidth of graphs Graphs and Combinatorics. 17: 463-471. DOI: 10.1007/Pl00013410 |
0.581 |
|
2000 |
Jiang T, Mubayi D, Shastri A, West DB. Correction to Edge-Bandwidth of Graphs Siam Journal On Discrete Mathematics. 13: 1-1. DOI: 10.1137/Sjdmec000013000001000001000001 |
0.595 |
|
2000 |
Caro Y, West DB, Yuster R. Connected domination and spanning trees with many leaves Siam Journal On Discrete Mathematics. 13: 202-211. DOI: 10.1137/S0895480199353780 |
0.558 |
|
2000 |
Asari H, Jiang T, Kündgen A, West DB. Perfection thickness of graphs Discrete Mathematics. 215: 263-264. DOI: 10.1016/S0012-365X(99)00322-2 |
0.565 |
|
2000 |
Bollobás B, West DB. A note on generalized chromatic number and generalized girth Discrete Mathematics. 213: 29-34. DOI: 10.1016/S0012-365X(99)00165-X |
0.458 |
|
2000 |
Mubayi D, West DB. On the number of vertices with specified eccentricity Graphs and Combinatorics. 16: 441-452. DOI: 10.1007/Pl00007229 |
0.739 |
|
2000 |
Eichhorn D, Mubayi D, O'Bryant K, West DB. The edge-bandwidth of theta graphs Journal of Graph Theory. 35: 89-98. DOI: 10.1002/1097-0118(200010)35:2<>1.0.Co;2-4 |
0.758 |
|
2000 |
Füredi Z, Mubayi D, West DB. Multiple vertex coverings by specified induced subgraphs Journal of Graph Theory. 34: 180-190. DOI: 10.1002/1097-0118(200006)34:2<>1.0.Co;2-P |
0.693 |
|
2000 |
Bollobás B, West DB. A note on generalized chromatic number and generalized girth Discrete Mathematics. 213: 29-34. |
0.32 |
|
1999 |
Jiang T, Mubayi D, Shastri A, West DB. Edge-Bandwidth of Graphs Siam Journal On Discrete Mathematics. 12: 307-316. DOI: 10.1137/S0895480197330758 |
0.732 |
|
1999 |
Shi W, West DB. Diagnosis of wiring networks: an optimal randomized algorithm for finding connected components of unknown graphs Siam Journal On Computing. 28: 1541-1551. DOI: 10.1137/S0097539795288118 |
0.55 |
|
1999 |
Jiang T, Mubayi D, Tuza Z, Voloshin V, West D. Chromatic spectrum is broken Electronic Notes in Discrete Mathematics. 3: 86-89. DOI: 10.1016/S1571-0653(05)80030-7 |
0.663 |
|
1999 |
Bogart KP, West DB. A short proof that “proper = unit” Discrete Mathematics. 201: 21-23. DOI: 10.1016/S0012-365X(98)00310-0 |
0.539 |
|
1999 |
Jiang T, West DB. Coloring of trees with minimum sum of colors Journal of Graph Theory. 32: 354-358. DOI: 10.1002/(Sici)1097-0118(199912)32:4<>1.0.Co;2-B |
0.498 |
|
1999 |
Lin IJ, Sen MK, West DB. Intersection representation of digraphs in trees with few leaves Journal of Graph Theory. 32: 340-353. DOI: 10.1002/(Sici)1097-0118(199912)32:4<>1.0.Co;2-B |
0.356 |
|
1999 |
Bogart KP, West DB. A short proof that 'proper = unit' Discrete Mathematics. 201: 21-23. |
0.38 |
|
1998 |
Lin I, McKee TA, West DB. The leafage of a chordal graph Discussiones Mathematicae Graph Theory. 18: 23-48. DOI: 10.7151/Dmgt.1061 |
0.605 |
|
1998 |
Liu X, West DB. Line digraphs and coreflexive vertex sets Discrete Mathematics. 188: 269-277. DOI: 10.1016/S0012-365X(98)00022-3 |
0.309 |
|
1998 |
Hung LTQ, Sysło MM, Weaver ML, West DB. Bandwidth and density for block graphs Discrete Mathematics. 189: 163-176. DOI: 10.1016/S0012-365X(98)00009-0 |
0.567 |
|
1997 |
Fisher DC, Fraughnaugh K, Langley L, West DB. The number of dependent arcs in an acyclic orientation Journal of Combinatorial Theory. Series B. 71: 73-78. DOI: 10.1006/Jctb.1997.1769 |
0.493 |
|
1997 |
Kostochka AV, West DB. Total Interval Number for Graphs with Bounded Degree Journal of Graph Theory. 25: 79-84. DOI: 10.1002/(Sici)1097-0118(199705)25:1<79::Aid-Jgt5>3.3.Co;2-4 |
0.586 |
|
1996 |
Kratzke TM, West DB. The total interval number of a graph II: Trees and complexity Siam Journal On Discrete Mathematics. 9: 339-348. DOI: 10.1137/S0895480193250162 |
0.624 |
|
1996 |
Chung MS, West DB. Large 2 P 3 -free graphs with bounded degree Discrete Mathematics. 150: 69-79. DOI: 10.1016/0012-365X(95)00176-W |
0.351 |
|
1996 |
West DB. The Superregular Graphs Journal of Graph Theory. 23: 289-295. DOI: 10.1002/(Sici)1097-0118(199611)23:3<289::Aid-Jgt8>3.3.Co;2-H |
0.563 |
|
1995 |
Alon N, Karp RM, Peleg D, West D. A Graph-Theoretic Game and Its Application to the k-Server Problem Siam Journal On Computing. 24: 78-100. DOI: 10.1137/S0097539792224474 |
0.497 |
|
1995 |
Rasmussen D, Savage CD, West DB. Gray code enumeration of families of integer partitions Journal of Combinatorial Theory, Series A. 70: 201-229. DOI: 10.1016/0097-3165(95)90090-X |
0.301 |
|
1995 |
Madej T, West DB. Interval number of special posets and random posets Discrete Mathematics. 144: 67-74. DOI: 10.1016/0012-365X(94)00287-S |
0.406 |
|
1995 |
West DB. Acyclic orientations of complete bipartite graphs Discrete Mathematics. 138: 393-396. DOI: 10.1016/0012-365X(94)00222-5 |
0.581 |
|
1995 |
Sen MK, Sanyal BK, West DB. Representing digraphs using intervals or circular arcs Discrete Mathematics. 147: 235-245. DOI: 10.1016/0012-365X(94)00167-H |
0.47 |
|
1995 |
Shi W, West DB. Optimal algorithms for finding connected components of an unknown graph Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 959: 131-140. DOI: 10.1007/BFb0030827 |
0.488 |
|
1995 |
Wang J, West DB, Yao B. Maximum Bandwidth Under Edge Addition Journal of Graph Theory. 20: 87-90. DOI: 10.1002/Jgt.3190200109 |
0.513 |
|
1995 |
Jacobson MS, Kézdy AE, West DB. The 2-intersection number of paths and bounded-degree trees Journal of Graph Theory. 19: 461-469. DOI: 10.1002/Jgt.3190190403 |
0.457 |
|
1994 |
West DB. Covering a poset by interval orders Journal of Combinatorial Theory, Series A. 66: 169-171. DOI: 10.1016/0097-3165(94)90057-4 |
0.363 |
|
1994 |
Bhasker J, Samad T, West DB. Size, chromatic number, and connectivity Graphs and Combinatorics. 10: 209-213. DOI: 10.1007/Bf02986667 |
0.534 |
|
1994 |
Chung MS, West DB. The p-intersection number of a complete bipartite graph and orthogonal double coverings of a clique Combinatorica. 14: 453-461. DOI: 10.1007/Bf01302966 |
0.605 |
|
1994 |
Weaver ML, West DB. Relaxed chromatic numbers of graphs Graphs and Combinatorics. 10: 75-93. DOI: 10.1007/Bf01202473 |
0.576 |
|
1993 |
Chang YW, Jacobson MS, Monma CL, West DB. Subtree and substar intersection numbers Discrete Applied Mathematics. 44: 205-220. DOI: 10.1016/0166-218X(93)90232-D |
0.546 |
|
1993 |
Kratzke TM, West DB. The total interval number of a graph, I: Fundamental classes Discrete Mathematics. 118: 145-156. DOI: 10.1016/0012-365X(93)90057-Z |
0.644 |
|
1993 |
Bollobás B, Erdos P, Spencer J, West DB. Clique coverings of the edges of a random graph Combinatorica. 13: 1-5. DOI: 10.1007/Bf01202786 |
0.577 |
|
1993 |
Chung MS, West DB. Large P 4 -free graphs with bounded degree Journal of Graph Theory. 17: 109-116. DOI: 10.1002/Jgt.3190170111 |
0.552 |
|
1992 |
Paoli M, Peck GW, Trotter WT, West DB. Large regular graphs with no induced 2 K2 Graphs and Combinatorics. 8: 165-197. DOI: 10.1007/Bf02350634 |
0.554 |
|
1991 |
Kleitman DJ, West DB. Spanning Trees with Many Leaves Siam Journal On Discrete Mathematics. 4: 99-106. DOI: 10.1137/0404010 |
0.679 |
|
1991 |
Madej T, West DB. The interval inclusion number of a partially ordered set Discrete Mathematics. 88: 259-277. DOI: 10.1016/0012-365X(91)90014-S |
0.339 |
|
1990 |
Bender EA, Kochman F, West DB. Adding up to powers American Mathematical Monthly. 97: 139-143. DOI: 10.2307/2323917 |
0.309 |
|
1990 |
Edelsbrunner H, Preparata F, West D. Tetrahedrizing point sets in three dimensions† Journal of Symbolic Computation. 10: 335-347. DOI: 10.1016/S0747-7171(08)80068-5 |
0.359 |
|
1989 |
Scheinerman ER, West DB. Interval representations of cliques and of subset intersection graphs Annals of the New York Academy of Sciences. 555: 363-367. DOI: 10.1111/J.1749-6632.1989.Tb22473.X |
0.554 |
|
1989 |
Ginsburg J, Sands B, West DB. A length-width inequality for partially ordered sets with two-element cutsets Journal of Combinatorial Theory, Series B. 46: 232-239. DOI: 10.1016/0095-8956(89)90044-0 |
0.329 |
|
1989 |
West DB. A short proof of the degree bound for interval number Discrete Mathematics. 73: 309-310. DOI: 10.1016/0012-365X(89)90276-8 |
0.479 |
|
1989 |
Sen MK, Das S, West DB. Circular-arc digraphs: a characterization Journal of Graph Theory. 13: 581-592. DOI: 10.1002/Jgt.3190130508 |
0.305 |
|
1989 |
Das S, Sen MK, Roy AB, West DB. Interval digraphs: An analogue of interval graphs Journal of Graph Theory. 13: 189-202. DOI: 10.1002/Jgt.3190130206 |
0.518 |
|
1988 |
Alsina C, West DB, Wiedemann DH, Griggs JR, Golomb SW, Keane J, Patruno G, Goffinet D. Elementary Problems: E3289-E3294 American Mathematical Monthly. 95: 872. DOI: 10.2307/2322909 |
0.583 |
|
1988 |
West DB, Banerjee P. On the Construction of Communication Networks Satisfying Bounded Fan-In of Service Ports Ieee Transactions On Computers. 37: 1148-1151. DOI: 10.1109/12.2270 |
0.384 |
|
1988 |
Kratzke T, Reznick B, West D. Eigensharp graphs: decomposition into complete bipartite subgraphs Transactions of the American Mathematical Society. 308: 637-653. DOI: 10.1090/S0002-9947-1988-0929670-5 |
0.629 |
|
1988 |
Miklós D, Newman MJ, Seress A, West DB. The addition game: an abstraction of a communication problem Discrete Mathematics. 68: 265-272. DOI: 10.1016/0012-365X(88)90118-5 |
0.35 |
|
1988 |
Muder DJ, Weaver ML, West DB. Pagenumber of complete bipartite graphs Journal of Graph Theory. 12: 469-489. DOI: 10.1002/Jgt.3190120403 |
0.555 |
|
1987 |
Aigner M, West DB. Sorting by insertion of leading elements Journal of Combinatorial Theory, Series A. 45: 306-309. DOI: 10.1016/0097-3165(87)90022-7 |
0.381 |
|
1987 |
Trotter WT, West DB. Poset boxicity of graphs Discrete Mathematics. 64: 105-107. DOI: 10.1016/0012-365X(87)90247-0 |
0.574 |
|
1987 |
West DB. Unichain coverings in partial orders with the nested saturation property Discrete Mathematics. 63: 297-303. DOI: 10.1016/0012-365X(87)90018-5 |
0.358 |
|
1987 |
Alon N, Trotter WT, West DB. Regressions and monotone chains II: The poset of integer intervals Order. 4: 155-164. DOI: 10.1007/Bf00337694 |
0.4 |
|
1987 |
Spinrad JP, Vijayan G, West DB. An improved edge bound on the interval number of a graph Journal of Graph Theory. 11: 447-449. DOI: 10.1002/Jgt.3190110318 |
0.457 |
|
1986 |
West DB. "Poly-unsaturated" posets: The Greene-Kleitman theorem is best possible Journal of Combinatorial Theory, Series A. 41: 105-116. DOI: 10.1016/0097-3165(86)90118-4 |
0.418 |
|
1985 |
Goldberg CH, West DB. Bisection of Circle Colorings Siam Journal On Algebraic and Discrete Methods. 6: 93-106. DOI: 10.1137/0606010 |
0.418 |
|
1985 |
Reznick B, Tiwari P, West DB. Decomposition of product graphs into complete bipartite subgraphs Discrete Mathematics. 57: 189-193. DOI: 10.1016/0012-365X(85)90167-0 |
0.59 |
|
1985 |
Erdös P, West DB. A note on the interval number of a graph Discrete Mathematics. 55: 129-133. DOI: 10.1016/0012-365X(85)90041-X |
0.559 |
|
1985 |
Tovey CA, West DB. Networks and chain coverings in partial orders and their products Order. 2: 49-60. DOI: 10.1007/Bf00337923 |
0.328 |
|
1984 |
West DB, Shmoys DB. Recognizing graphs with fixed interval number is NP-complete Discrete Applied Mathematics. 8: 295-305. DOI: 10.1016/0166-218X(84)90127-6 |
0.557 |
|
1984 |
Hopkins LB, Trotter WT, West DB. The interval number of a complete multipartite graph Discrete Applied Mathematics. 8: 163-187. DOI: 10.1016/0166-218X(84)90099-4 |
0.489 |
|
1984 |
West DB, Trotter WT, Peck GW, Shor P. Regressions and monotone chains: A ramsey-type extremal problem for partial orders Combinatorica. 4: 117-119. DOI: 10.1007/Bf02579164 |
0.398 |
|
1983 |
West DB, Harper LH, Daykin DE. Some remarks on normalized matching Journal of Combinatorial Theory, Series A. 35: 301-308. DOI: 10.1016/0097-3165(83)90015-8 |
0.356 |
|
1983 |
Scheinerman ER, West DB. The interval number of a planar graph: Three intervals suffice Journal of Combinatorial Theory, Series B. 35: 224-239. DOI: 10.1016/0095-8956(83)90050-3 |
0.601 |
|
1982 |
West DB. Gossiping Without Duplicate Transmissions Siam Journal On Algebraic and Discrete Methods. 3: 418-419. DOI: 10.1137/0603042 |
0.313 |
|
1982 |
West DB. A class of solutions to the gossip problem, part II Discrete Mathematics. 40: 87-113. DOI: 10.1016/0012-365X(82)90153-4 |
0.555 |
|
1982 |
West DB. A class of solutions to the gossip problem, part III Discrete Mathematics. 40: 285-310. DOI: 10.1016/0012-365X(82)90128-5 |
0.454 |
|
1981 |
West DB, Tovey CA. Semiantichains and Unichain Coverings in Direct Products of Partial Orders Siam Journal On Algebraic Discrete Methods. 2: 295-305. DOI: 10.1137/0602032 |
0.411 |
|
1980 |
Griggs JR, West DB. Extremal Values of the Interval Number of a Graph Siam Journal On Algebraic and Discrete Methods. 1: 1-7. DOI: 10.1137/0601001 |
0.809 |
|
1980 |
West DB. A Symmetric Chain Decomposition of L(4, n) European Journal of Combinatorics. 1: 379-383. DOI: 10.1016/S0195-6698(80)80040-0 |
0.322 |
|
1979 |
Daykin DE, Kleitman DJ, West DB. The number of meets between two subsets of a lattice Journal of Combinatorial Theory, Series A. 26: 135-156. DOI: 10.1016/0097-3165(79)90063-3 |
0.57 |
|
1979 |
West DB, Kleitman DJ. Skew chain orders and sets of rectangles Discrete Mathematics. 27: 99-102. DOI: 10.1016/0012-365X(79)90073-6 |
0.549 |
|
1978 |
West DB. Pairs of Adjacent Hamiltonian Circuits with Small Intersection Studies in Applied Mathematics. 59: 245-248. DOI: 10.1002/Sapm1978593245 |
0.328 |
|
Show low-probability matches. |