LLLarry J. Langley
Larry J. Langley
*This is an algorithmically generated author record based on publicly available information.
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Larry J. Langley has a total of 4 co-authors. Here are the top co-authors by number of shared publications:
- Breeann M. Flesch
Columbia University Western Oregon University Willamette University Willamette University University of Oregon
2 shared publications - David E. Brown
Utah State University
2 shared publications David E. Brown
Utah State University
1 shared publicationMatthew T. Cowen
University of California Davis
1 shared publication
Latest Publications
- 16 July 2025
- Published by Springer Nature
- p. 123-128
An Extension of Seymour’s Second Neighborhood Conjecture
- 16 July 2025
- Published by Springer Nature
- p. 123-128
An Extension of Seymour’s Second Neighborhood Conjecture
- 17 November 2017
- Published by Springer Nature in Order
- Vol. 35 (3) , 495-514
Interval k-Graphs and Orders
- 17 November 2017
- Published by Springer Nature in Order
- Vol. 35 (3) , 495-514
Interval k-Graphs and Orders
- Open Access
Interval k-Graphs and Orders
An interval $k$-graph is the intersection graph of a family $\mathcal{I}$ of intervals of the real line partitioned into at most $k$ classes with vertices adjacent if and only if their corresponding intervals intersect and belong to different classes. In this paper we discuss the interval $k$-graphs that are the incomparability graphs of orders; i.e., cocomparability interval $k$-graphs or interval $k$-orders. Interval $2$-orders have been characterized in many ways, but we show that analogous characterizations do not carry over to interval $k$-orders, for $k > 2$. We describe the structure of interval $k$-orders, for any $k$, characterize the interval $3$-orders (cocomparability interval $3$-graphs) via one forbidden suborder (subgraph), and state a conjecture for interval $k$-orders (any $k$) that would characterize them via two forbidden suborders.Open AccessInterval k-Graphs and Orders
An interval $k$-graph is the intersection graph of a family $\mathcal{I}$ of intervals of the real line partitioned into at most $k$ classes with vertices adjacent if and only if their corresponding intervals intersect and belong to different classes. In this paper we discuss the interval $k$-graphs that are the incomparability graphs of orders; i.e., cocomparability interval $k$-graphs or interval $k$-orders. Interval $2$-orders have been characterized in many ways, but we show that analogous characterizations do not carry over to interval $k$-orders, for $k > 2$. We describe the structure of interval $k$-orders, for any $k$, characterize the interval $3$-orders (cocomparability interval $3$-graphs) via one forbidden suborder (subgraph), and state a conjecture for interval $k$-orders (any $k$) that would characterize them via two forbidden suborders.