William T. Trotter

According to our database1, William T. Trotter authored at least 96 papers between 1973 and 2018.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of one.



In proceedings 
PhD thesis 



On csauthors.net:


Burling Graphs, Chromatic Number, and Orthogonal Tree-Decompositions.
Electr. J. Comb., 2018

On the Dimension of Posets with Cover Graphs of Treewidth 2.
Order, 2017

Boolean Dimension and Local Dimension.
Electronic Notes in Discrete Mathematics, 2017

Burling graphs, chromatic number, and orthogonal tree-decompositions.
Electronic Notes in Discrete Mathematics, 2017

Planar Posets, Dimension, Breadth and the Number of Minimal Elements.
Order, 2016

Dimension and Matchings in Comparability and Incomparability Graphs.
Order, 2016

Posets and VPG Graphs.
Order, 2016

Forcing Posets with Large Dimension to Contain Large Standard Examples.
Graphs and Combinatorics, 2016

First-fit coloring on interval graphs has performance ratio at least 5.
Eur. J. Comb., 2016

Tree-width and dimension.
Combinatorica, 2016

The Dimension of Posets with Planar Cover Graphs.
Graphs and Combinatorics, 2015

Incidence Posets and Cover Graphs.
Order, 2014

Triangle-free intersection graphs of line segments with large chromatic number.
J. Comb. Theory, Ser. B, 2014

An extremal problem on crossing vectors.
J. Comb. Theory, Ser. A, 2014

Hamiltonian Cycles and Symmetric Chains in Boolean Lattices.
Graphs and Combinatorics, 2014

Dimension and height for posets with planar cover graphs.
Eur. J. Comb., 2014

On-Line Dimension for Posets Excluding Two Long Incomparable Chains.
Order, 2013

Triangle-Free Geometric Intersection Graphs with Large Chromatic Number.
Discrete & Computational Geometry, 2013

Applications of the Probabilistic Method to Partially Ordered Sets.
Proceedings of the Mathematics of Paul Erdős II, 2013

Dimension and Height for Posets with Planar Cover Graphs.
Electronic Notes in Discrete Mathematics, 2011

A combinatorial approach to height sequences in finite partially ordered sets.
Discrete Mathematics, 2011

Intersection Graphs of Pseudosegments: Chordal Graphs.
J. Graph Algorithms Appl., 2010

Interval partitions and Stanley depth.
J. Comb. Theory, Ser. A, 2010

On the size of maximal antichains and the number of pairwise disjoint maximal chains.
Discrete Mathematics, 2010

Adjacency posets of planar graphs.
Discrete Mathematics, 2010

Segment Orders.
Discrete & Computational Geometry, 2010

Bar k-Visibility Graphs.
J. Graph Algorithms Appl., 2007

Posets and planar graphs.
Journal of Graph Theory, 2005

Bar k-Visibility Graphs: Bounds on the Number of Edges, Chromatic Number, and Thickness.
Proceedings of the Graph Drawing, 13th International Symposium, 2005

A Note on Graph Pebbling.
Graphs and Combinatorics, 2002

Containment orders for similar ellipses with a common center.
Discrete Mathematics, 2002

A combinatorial approach to correlation inequalities.
Discrete Mathematics, 2002

Competitive Colorings of Oriented Graphs.
Electr. J. Comb., 2001

Spanning Trees of Bounded Degree.
Electr. J. Comb., 2001

Dimension, Graph and Hypergraph Coloring.
Order, 2000

Interval orders and dimension.
Discrete Mathematics, 2000

Combinatorial Aspects of Interval Orders and Interval Graphs.
Electronic Notes in Discrete Mathematics, 1999

Discrete Mathematics, 1999

Split semiorders.
Discrete Mathematics, 1999

Finite three dimensional partial orders which are not sphere orders.
Discrete Mathematics, 1999

The maximum number of edges in a graph of bounded dimension, with applications to ring theory.
Discrete Mathematics, 1999

Ramsey Theory and Sequences of Random Variables.
Combinatorics, Probability & Computing, 1998

The Order Dimension of Planar Maps.
SIAM J. Discrete Math., 1997

Ramsey theory and partially ordered sets.
Proceedings of the Contemporary Trends in Discrete Mathematics: From DIMACS and DIMATIA to the Future, 1997

On-Line and First-Fit Coloring of Graphs That Do Not Induce P5.
SIAM J. Discrete Math., 1995

Colorings of diagrams of interval orders and alpha-sequences of sets.
Discrete Mathematics, 1995

On-Line Coloring and Recursive Graph Theory.
SIAM J. Discrete Math., 1994

On the fractional dimension of partially ordered sets.
Discrete Mathematics, 1994

On the poset of all posets on n elements.
Discrete Applied Mathematics, 1994

The Order Dimension of Convex Polytopes.
SIAM J. Discrete Math., 1993

Induced matchings in cubic graphs.
Journal of Graph Theory, 1993

Critically indecomposable partially ordered sets, graphs, tournaments and other binary relational structures.
Discrete Mathematics, 1993

Dimensions of hypergraphs.
J. Comb. Theory, Ser. B, 1992

Large regular graphs with no induced 2K2.
Graphs and Combinatorics, 1992

Colorful induced subgraphs.
Discrete Mathematics, 1992

Linear extensions of semiorders: a maximization problem.
Discrete Mathematics, 1992

The Number of Different Distances Determined by a Set of Points in the Euclidean Plane.
Discrete & Computational Geometry, 1992

The Dimension of Random Ordered Sets.
Random Struct. Algorithms, 1991

Fibres and ordered set coloring.
J. Comb. Theory, Ser. A, 1991

Planar Graph Coloring with an Uncooperative Partner.
Proceedings of the Planar Graphs, 1991

On-line Graph Coloring.
Proceedings of the On-Line Algorithms, 1991

The maximum number of edges in 2K2-free graphs of bounded degree.
Discrete Mathematics, 1990

An on-line graph coloring algorithm with sublinear performance ratio.
Discrete Mathematics, 1989

Threshold tolerance graphs.
Journal of Graph Theory, 1988

Poset boxicity of graphs.
Discrete Mathematics, 1987

A note on ranking functions.
Discrete Mathematics, 1987

A Ramsey theoretic problem for finite ordered sets.
Discrete Mathematics, 1987

The dimension of the Cartesian product of partial orders.
Discrete Mathematics, 1985

A Sperner Theorem on Unrelated Chains of Subsets.
J. Comb. Theory, Ser. A, 1984

The interval number of a complete multipartite graph.
Discrete Applied Mathematics, 1984

Tolerance graphs.
Discrete Applied Mathematics, 1984

Regressions and monotone chains: a ramsey - type extermal problem for partial orders.
Combinatorica, 1984

On coloring graphs with locally small chromatic number.
Combinatorica, 1984

The Ramsey number of a graph with bounded maximum degree.
J. Comb. Theory, Ser. B, 1983

A Combinatorial Distinction Between the Euclidean and Projective Planes.
Eur. J. Comb., 1983

Extremal problems in discrete geometry.
Combinatorica, 1983

On Determinism versus Non-Determinism and Related Problems (Preliminary Version)
Proceedings of the 24th Annual Symposium on Foundations of Computer Science, 1983

A combinatorial problem involving graphs and matrices.
Discrete Mathematics, 1982

Stacks and splits of partially ordered sets.
Discrete Mathematics, 1981

A generalization of Turán's theorem to directed graphs.
Discrete Mathematics, 1980

Large minimal realizers of a partial order II.
Discrete Mathematics, 1980

On double and multiple interval graphs.
Journal of Graph Theory, 1979

A characterization of robert's inequality for boxicity.
Discrete Mathematics, 1979

When the cartesian product of directed cycles is Hamiltonian.
Journal of Graph Theory, 1978

The dimension of planar posets.
J. Comb. Theory, Ser. B, 1977

A Forbidden Subposet Characterization of an Order-Dimension Inequality.
Mathematical Systems Theory, 1976

A Generalization of Hiraguchi's: Inequality for Posets.
J. Comb. Theory, Ser. A, 1976

A Bound on the Dimension of Interval Orders.
J. Comb. Theory, Ser. A, 1976

Some theorems on graphs and posets.
Discrete Mathematics, 1976

Characterization problems for graphs, partially ordered sets, lattices, and families of sets.
Discrete Mathematics, 1976

Maximal dimensional partially ordered sets III: a characterization of Hiraguchi's inequality for interval dimension.
Discrete Mathematics, 1976

On the complexity of posets.
Discrete Mathematics, 1976

Embedding finite posets in cubes.
Discrete Mathematics, 1975

Irreducible Posets with Large Height Exist.
J. Comb. Theory, Ser. A, 1974

Dimension of the crown Skn.
Discrete Mathematics, 1974

Maximal dimensional partially ordered sets II. characterization of 2n-element posets with dimension n.
Discrete Mathematics, 1973