David Brown Ph.D

Publications | Book Chapters

• Brown, D.E, Langley, L.J, (2009). Probe Interval Orders: The Mathematics of Preference, Choice and Order: Essays in Honor of Peter C. Fishburn. Springer-Verlag

An asterisk (*) at the end of a publication indicates that it has not been peer-reviewed.

Publications | Journal Articles

Academic Journal

• Brown, D.E, Flesch, B.M, (2014). A Characterization of 2-tree Proper Interval 3-Graphs. Hindawi Publishing Corporation, 2014, doi: 10.1155/2014/143809
• Brown, D.E, Das Gupta, S., Lundgren, J.R, A characterization of interior 2-caterpillars.. Congressus Numerantium, 212, 77 - 96.
• Brown, D.E, Roy, S.M, Lundgren, J.R, Siewert, D.J, Boolean rank of upset tournament matrices. Linear Algebra and its Applications, 436:9, 3239-3246.
• Brown, D.E, Langley, L.J, Forbidden Subgraph Characterization of Bipartite Unit Probe Interval Graphs. Australasian Journal of Combinatorics, 52, 19-31.
• Brown, D.E, Busch, A.H, Isaak, G., (2010). Linear Time Recognition Algorithms and Structure Theorems for Bipartite Tolerance and Bipartite Probe Interval Graphs. Discrete Mathematics and Theoretical Computer Science, 12:5, 63-82.
• Beasley, L.B, Brown, D.E, (2010). Cycle Extendability in Graphs and Digraphs. Linear Algebra and its Applications, doi: DOI:10.1016/j.laa.2010.04.038.
• Brown, D.E, Lundgren, J.R, Sheng, L., (2009). A Characterization of Cycle-free Unite Probe Interval Graphs. Discrete Applie Math, 157, 762-767.
• Beasley, L.B, Brown, D.E, (2009). Embedding tournaments. Congressus Numerantium, 198, 207-210.
• Beasley, L.B, Brown, D.E, Reid, K.B, (2009). Extending Partial Tournaments. Mathematical and Computer Modeling, 50, 287-291.
• Beasley, L.B, Brown, D.E, Guterman, S., (2009). Preserving Regular Tournaments and Term Rank-1. Linear Algebra and its Applications5-7, 926-936.
• Brown, D.E, Busch, A.H, Lundgren, J.R, (2007). Interval Tournaments. Journal of Graph theory, 56:1, 72-81.
• Brown, D.E, Lundgren, J.R, (2006). Bipartite Probe Interval Graphs, Interval Point Bigraphs, and Circular Arc Graphs. Australasian Journal of Combinatorics, 35, 221-236.
• Beasley, L.B, Brown, D.E, (2005). On cycle and bi-cycle extendability in chordal and chordal bipartite graphs. Congressus Numerantium, 174, 41-47.
• Brown, D.E, Lundgren, J.R, (2004). Relationships Among Classes of Interval Bigraphs, (0,1)-matrices, and Circular Arc Graphs. Congressus Numerantium, 166, 97-123.
• Brown, D.E, Brown, D.E, Flink, S.C, (2002). Characterizations of Interval Bigraphs and Unit Interval Bigraphs. Congressus Numerantium, 157, 79-93.
• Brown, D.E, Flink, S.C, Lundgren, J.R, (2002). Interval k-graphs. Congressus Numerantium, 156, 5-16.
• Brown, D.E, Brown, D.E, Miller, C., (2001). Variations on Interval Graphs. Congressus Numerantium, 149, 77-95.

Professional Journal

An asterisk (*) at the end of a publication indicates that it has not been peer-reviewed.

Publications | Other

An asterisk (*) at the end of a publication indicates that it has not been peer-reviewed.