Douglas B. West

Am. Math. Mon., 2020

Degree Lists and Connectedness are 3-Reconstructible for Graphs with At Least Seven Vertices.

[BibT_eX]

[DOI]

,

Mina Nahvi

,

,

Dara Zirlin

Graphs Comb., 2020

Upper bounds for bar visibility of subgraphs and n-vertex graphs.

[BibT_eX]

[DOI]

Yuanrui Feng

,

,

Yan Yang

Discret. Appl. Math., 2020

Lichiardopol's Conjecture on Disjoint Cycles in Tournaments.

[BibT_eX]

[DOI]

Fuhong Ma

,

,

Jin Yan

Electron. J. Comb., 2020

Strongly connectable digraphs and non-transitive dice.

[BibT_eX]

[DOI]

,

,

,

AKCE Int. J. Graphs Comb., 2020

Problems and Solutions.

[BibT_eX]

[DOI]

,

,

,

Am. Math. Mon., 2019

Reconstruction from the deck of -vertex induced subgraphs.

[BibT_eX]

[DOI]

Hannah Spinoza

,

J. Graph Theory, 2019

Ramsey Numbers of Interval 2-Chromatic Ordered Graphs.

[BibT_eX]

[DOI]

Dana Neidinger

,

Graphs Comb., 2019

Largest 2-Regular Subgraphs in 3-Regular Graphs.

[BibT_eX]

[DOI]

Ilkyoo Choi

,

Ringi Kim

,

,

Boram Park

,

Graphs Comb., 2019

Extensions of matroid covering and packing.

[BibT_eX]

[DOI]

,

,

,

,

,

Eur. J. Comb., 2019

Antipodal edge-colorings of hypercubes.

[BibT_eX]

[DOI]

,

Jennifer Wise

Discuss. Math. Graph Theory, 2019

Online sum-paintability: Slow-coloring of trees.

[BibT_eX]

[DOI]

Gregory J. Puleo

,

Discret. Appl. Math., 2019

Extremal problems on saturation for the family of k-edge-connected graphs.

[BibT_eX]

[DOI]

,

,

,

,

Discret. Appl. Math., 2019

The unit acquisition number of a graph.

[BibT_eX]

[DOI]

,

,

,

Discret. Appl. Math., 2019

Problems and Solutions.

[BibT_eX]

[DOI]

Gerald A. Edgar

,

Daniel H. Ullman

,

Am. Math. Mon., 2018

Fractional and circular separation dimension of graphs.

[BibT_eX]

[DOI]

Sarah Loeb

,

Eur. J. Comb., 2018

Randomly twisted hypercubes.

[BibT_eX]

[DOI]

,

,

,

,

,

Eur. J. Comb., 2018

Online sum-paintability: The slow-coloring game.

[BibT_eX]

[DOI]

Thomas Mahoney

,

Gregory J. Puleo

,

Discret. Math., 2018

The vulnerability of the diameter of the enhanced hypercubes.

[BibT_eX]

[DOI]

Meijie Ma

,

,

Jun-Ming Xu

Theor. Comput. Sci., 2017

Uniquely Cycle-Saturated Graphs.

[BibT_eX]

[DOI]

Paul S. Wenger

,

J. Graph Theory, 2017

Minimum Degree and Dominating Paths.

[BibT_eX]

[DOI]

,

,

,

J. Graph Theory, 2017

The Game Saturation Number of a Graph.

[BibT_eX]

[DOI]

James M. Carraher

,

,

Benjamin Reiniger

,

J. Graph Theory, 2017

Decomposition of sparse graphs into forests: The Nine Dragon Tree Conjecture for k ≤ 2.

[BibT_eX]

[DOI]

Min Chen

,

,

,

,

Xuding Zhu

J. Comb. Theory B, 2017

Bar Visibility Numbers for Hypercubes and Outerplanar Digraphs.

[BibT_eX]

[DOI]

,

Jennifer Wise

Graphs Comb., 2017

An introduction to the discharging method via graph coloring.

[BibT_eX]

[DOI]

,

Discret. Math., 2017

To catch a falling robber.

[BibT_eX]

[DOI]

,

Pawel Pralat

,

Theor. Comput. Sci., 2016

Anti-Ramsey Problems for t Edge-Disjoint Rainbow Spanning Subgraphs: Cycles, Matchings, or Trees.

[BibT_eX]

[DOI]

Sogol Jahanbekam

,

J. Graph Theory, 2016

Cubic Graphs with Large Ratio of Independent Domination Number to Domination Number.

[BibT_eX]

[DOI]

,

Graphs Comb., 2016

Rainbow Spanning Subgraphs of Small Diameter in Edge-Colored Complete Graphs.

[BibT_eX]

[DOI]

Sogol Jahanbekam

,

Graphs Comb., 2016

A new proof that 4-connected planar graphs are Hamiltonian-connected.

[BibT_eX]

[DOI]

Xiaoyun Lu

,

Discuss. Math. Graph Theory, 2016

Extremal problems for degree-based topological indices.

[BibT_eX]

[DOI]

Yunfang Tang

,

,

Bo Zhou

Discret. Appl. Math., 2016

On r-dynamic coloring of graphs.

[BibT_eX]

[DOI]

,

,

,

Discret. Appl. Math., 2016

Spanning Trees in 2-trees.

[BibT_eX]

[DOI]

P. Renjith

,

N. Sadagopan

,

CoRR, 2016

The adversary degree-associated reconstruction number of double-brooms.

[BibT_eX]

[DOI]

Meijie Ma

,

Huangping Shi

,

J. Discrete Algorithms, 2015

Sum-Paintability of Generalized Theta-Graphs.

[BibT_eX]

[DOI]

,

,

,

Graphs Comb., 2015

Beyond Ohba's Conjecture: A bound on the choice number of k-chromatic graphs with n vertices.

[BibT_eX]

[DOI]

,

,

,

Eur. J. Comb., 2015

Sharp bounds for the Chinese Postman Problem in 3-regular graphs and multigraphs.

[BibT_eX]

[DOI]

,

Discret. Appl. Math., 2015

On r-dynamic coloring of grids.

[BibT_eX]

[DOI]

Ross J. Kang

,

Tobias Müller

,

Discret. Appl. Math., 2015

Sharp lower bounds on the fractional matching number.

[BibT_eX]

[DOI]

Roger E. Behrend

,

,

Discret. Appl. Math., 2015

Linear Discrepancy of Chain Products and Posets with Bounded Degree.

[BibT_eX]

[DOI]

Jeong-Ok Choi

,

,

Order, 2014

The 1, 2, 3-Conjecture and 1, 2-Conjecture for sparse graphs.

[BibT_eX]

[DOI]

,

Sogol Jahanbekam

,

Discuss. Math. Graph Theory, 2014

Cutwidth of triangular grids.

[BibT_eX]

[DOI]

Lan Lin

,

Yixun Lin

,

Discret. Math., 2014

Permutation bigraphs and interval containments.

[BibT_eX]

[DOI]

,

,

,

Discret. Appl. Math., 2014

Equicovering Subgraphs of Graphs and Hypergraphs.

[BibT_eX]

[DOI]

,

,

,

Electron. J. Comb., 2014

Total Acquisition in Graphs.

[BibT_eX]

[DOI]

,

,

,

,

SIAM J. Discret. Math., 2013

Extremal Problems for Game Domination Number.

[BibT_eX]

[DOI]

,

,

Reza Zamani

SIAM J. Discret. Math., 2013

Visibility Number of Directed Graphs.

[BibT_eX]

[DOI]

,

,

,

SIAM J. Discret. Math., 2013

Bounds on the k-dimension of Products of Special Posets.

[BibT_eX]

[DOI]

Michael Baym

,

Order, 2013

Decomposition of Sparse Graphs into Forests and a Graph with Bounded Degree.

[BibT_eX]

[DOI]

,

,

,

Hehui Wu

,

Xuding Zhu

J. Graph Theory, 2013

Extremal Graphs With a Given Number of Perfect Matchings.

[BibT_eX]

[DOI]

,

,

,

J. Graph Theory, 2013

Choosability of Graphs with Bounded Order: Ohba's Conjecture and Beyond.

[BibT_eX]

[DOI]

,

,

,

,

Electron. Notes Discret. Math., 2013

Degree Ramsey numbers for cycles and blowups of trees.

[BibT_eX]

[DOI]

,

,

Eur. J. Comb., 2013

Rainbow edge-coloring and rainbow domination.

[BibT_eX]

[DOI]

,

Discret. Math., 2013

Acquisition-extremal graphs.

[BibT_eX]

[DOI]

,

Discret. Appl. Math., 2013

Game matching number of graphs.

[BibT_eX]

[DOI]

,

,

,

Discret. Appl. Math., 2013

Beyond Ohba's Conjecture: A bound on the choice number of k-chromatic graphs with n vertices.

[BibT_eX]

[DOI]

,

,

,

CoRR, 2013

Extensions to 2-Factors in Bipartite Graphs.

[BibT_eX]

[DOI]

,

Electron. J. Comb., 2013

Locating a robber on a graph via distance queries.

[BibT_eX]

[DOI]

,

,

,

,

Theor. Comput. Sci., 2012

Revolutionaries and spies: Spy-good and spy-bad graphs.

[BibT_eX]

[DOI]

,

,

,

,

Theor. Comput. Sci., 2012

Spanning Cycles Through Specified Edges in Bipartite Graphs.

[BibT_eX]

[DOI]

Reza Zamani

,

J. Graph Theory, 2012

Overlap number of graphs.

[BibT_eX]

[DOI]

,

Nitish Korula

,

,

,

Christopher J. Stocker

,

,

J. Graph Theory, 2012

Packing of graphic n-tuples.

[BibT_eX]

[DOI]

,

,

,

,

,

J. Graph Theory, 2012

The A4-structure of a graph.

[BibT_eX]

[DOI]

Michael D. Barrus

,

J. Graph Theory, 2012

Packing of Steiner trees and S-connectors in graphs.

[BibT_eX]

[DOI]

Seyed Mahmoud Sheikholeslami

,

Hehui Wu

J. Comb. Theory B, 2012

Cycle spectra of Hamiltonian graphs.

[BibT_eX]

[DOI]

,

,

,

,

J. Comb. Theory B, 2012

Connected Domination Number of a Graph and its Complement.

[BibT_eX]

[DOI]

Hossein Karami

,

,

Abdollah Khodkar

,

Graphs Comb., 2012

Uniquely C 4-Saturated Graphs.

[BibT_eX]

[DOI]

Joshua N. Cooper

,

John Lenz

,

,

Paul S. Wenger

,

Graphs Comb., 2012

Length thresholds for graphic lists given fixed largest and smallest entries and bounded gaps.

[BibT_eX]

[DOI]

,

,

,

Discret. Math., 2012

Degree Ramsey Numbers of Graphs.

[BibT_eX]

[DOI]

,

,

Comb. Probab. Comput., 2012

Longest cycles in k-connected graphs with given independence number.

[BibT_eX]

[DOI]

,

,

Hehui Wu

J. Comb. Theory B, 2011

A short proof of the Berge-Tutte Formula and the Gallai-Edmonds Structure Theorem.

[BibT_eX]

[DOI]

Eur. J. Comb., 2011

Matching and edge-connectivity in regular graphs.

[BibT_eX]

[DOI]

,

Eur. J. Comb., 2011

Revolutionaries and spies on trees and unicyclic graphs

[BibT_eX]

[DOI]

,

Clifford D. Smyth

,

CoRR, 2011

Acyclic Sets in k-Majority Tournaments.

[BibT_eX]

[DOI]

,

Daniel H. Schreiber

,

Electron. J. Comb., 2011

Equitable Hypergraph Orientations.

[BibT_eX]

[DOI]

Yair Caro

,

,

Raphael Yuster

Electron. J. Comb., 2011

On-line Ramsey Theory for Bounded Degree Graphs.

[BibT_eX]

[DOI]

Jane Butterfield

,

Tracy Grauman

,

,

,

Christopher J. Stocker

,

Electron. J. Comb., 2011

A new proof of 3-colorability of Eulerian triangulations.

[BibT_eX]

[DOI]

Mu-Tsun Tsai

,

Ars Math. Contemp., 2011

Balloons, cut-edges, matchings, and total domination in regular graphs of odd degree.

[BibT_eX]

[DOI]

,

J. Graph Theory, 2010

Oriented diameter of graphs with diameter 3.

[BibT_eX]

[DOI]

Peter K. Kwok

,

,

J. Comb. Theory B, 2010

Forbidden subposets for fractional weak discrepancy at most k.

[BibT_eX]

[DOI]

Jeong-Ok Choi

,

Eur. J. Comb., 2010

A short constructive proof of the Erdos-Gallai characterization of graphic lists.

[BibT_eX]

[DOI]

Amitabha Tripathi

,

Sushmita Venugopalan

,

Discret. Math., 2010

Decomposition of sparse graphs, with application to game coloring number.

[BibT_eX]

[DOI]

,

,

,

,

Discret. Math., 2010

Degree-associated reconstruction number of graphs.

[BibT_eX]

[DOI]

Michael D. Barrus

,

Discret. Math., 2010

Rainbow Matching in Edge-Colored Graphs.

[BibT_eX]

[DOI]

,

Christopher J. Stocker

,

Paul S. Wenger

,

Electron. J. Comb., 2010

The Edge-Count Criterion for Graphic Lists.

[BibT_eX]

[DOI]

Garth Isaak

,

Electron. J. Comb., 2010

On the Pagenumber of k-Trees.

[BibT_eX]

[DOI]

,

,

Gexin Yu

SIAM J. Discret. Math., 2009

Matching Extendability in Hypercubes.

[BibT_eX]

[DOI]

,

SIAM J. Discret. Math., 2009

Classes of 3-Regular Graphs That Are (7, 2)-Edge-Choosable.

[BibT_eX]

[DOI]

,

SIAM J. Discret. Math., 2009

Extremal Problems for Roman Domination.

[BibT_eX]

[DOI]

Erin W. Chambers

,

,

Noah Prince

,

SIAM J. Discret. Math., 2009

Implications among linkage properties in graphs.

[BibT_eX]

[DOI]

,

,

Gexin Yu

J. Graph Theory, 2009

Proper path-factors and interval edge-coloring of (3, 4)-biregular bigraphs.

[BibT_eX]

[DOI]

Armen S. Asratian

,

Carl Johan Casselgren

,

,

J. Graph Theory, 2009

Independence Number of 2-Factor-Plus-Triangles Graphs.

[BibT_eX]

[DOI]

,

Electron. J. Comb., 2009

Chromatic Number for a Generalization of Cartesian Product Graphs.

[BibT_eX]

[DOI]

Daniel Král'

,

Electron. J. Comb., 2009

Repetition Number of Graphs.

[BibT_eX]

[DOI]

Yair Caro

,

Electron. J. Comb., 2009

Problem 11372.

[BibT_eX]

[DOI]

,

Am. Math. Mon., 2008

Long Local Searches for Maximal Bipartite Subgraphs.

[BibT_eX]

[DOI]

Hemanshu Kaul

,

SIAM J. Discret. Math., 2008

Duality for Semiantichains and Unichain Coverings in Products of Special Posets.

[BibT_eX]

[DOI]

,

Order, 2008

Circular chromatic index of Cartesian products of graphs.

[BibT_eX]

[DOI]

,

Xuding Zhu

J. Graph Theory, 2008

Pebbling and optimal pebbling in graphs.

[BibT_eX]

[DOI]

,

,

,

,

J. Graph Theory, 2008

The hub number of a graph.

[BibT_eX]

[DOI]

Tracy Grauman

,

Stephen G. Hartke

,

Adam S. Jobson

,

,

,

,

,

Inf. Process. Lett., 2008

Triangle-free planar graphs with minimum degree 3 have radius at least 3.

[BibT_eX]

[DOI]

,

Discuss. Math. Graph Theory, 2008

Tree-Thickness and Caterpillar-Thickness under Girth Constraints.

[BibT_eX]

[DOI]

,

Electron. J. Comb., 2008

Optimal strong parity edge-coloring of complete graphs.

[BibT_eX]

[DOI]

,

,

,

Comb., 2008

Improved Bounds on Families Under k -wise Set-Intersection Constraints.

[BibT_eX]

[DOI]

Weiting Cao

,

Kyung-Won Hwang

,

Graphs Comb., 2007

Editorial Announcement: Hello, World.

[BibT_eX]

[DOI]

Discret. Math., 2007

Research problems from the 5th Slovenian Conference (Bled, 2003).

[BibT_eX]

[DOI]

Bojan Mohar

,

Richard J. Nowakowski

,

Discret. Math., 2007

Short proofs for cut-and-paste sorting of permutations.

[BibT_eX]

[DOI]

,

Ivan Hal Sudborough

,

Discret. Math., 2007

Extending precolorings to circular colorings.

[BibT_eX]

[DOI]

Michael O. Albertson

,

J. Comb. Theory B, 2006

Chvátal's Condition cannot hold for both a graph and its complement.

[BibT_eX]

[DOI]

,

Discuss. Math. Graph Theory, 2006

Nordhaus-Gaddum-type Theorems for decompositions into many parts.

[BibT_eX]

[DOI]

Zoltán Füredi

,

,

Riste Skrekovski

,

Michael Stiebitz

,

J. Graph Theory, 2005

Hypergraph Extension Of The Alon-Tarsi List Coloring Theorem.

[BibT_eX]

[DOI]

Radhika Ramamurthi

,

Comb., 2005

Adjacency Matrices That Are Incidence Matrices: 10967.

[BibT_eX]

[DOI]

,

Csaba Megyeri

Am. Math. Mon., 2004

The Bar Visibility Number of a Graph.

[BibT_eX]

[DOI]

,

,

,

,

SIAM J. Discret. Math., 2004

Precoloring Extensions of Brooks' Theorem.

[BibT_eX]

[DOI]

Michael O. Albertson

,

,

SIAM J. Discret. Math., 2004

Homomorphisms from sparse graphs with large girth.

[BibT_eX]

[DOI]

Oleg V. Borodin

,

,

,

J. Comb. Theory B, 2004

On Pattern Ramsey Numbers of Graphs.

[BibT_eX]

[DOI]

Robert E. Jamison

,

Graphs Comb., 2004

Interval numbers of powers of block graph.

[BibT_eX]

[DOI]

Mingjang Chen

,

Gerard J. Chang

,

Discret. Math., 2004

Graphic and Protographic Lists of Integers.

[BibT_eX]

[DOI]

Dmitry Fon-Der-Flaass

,

Electron. J. Comb., 2004

A list analogue of equitable coloring.

[BibT_eX]

[DOI]

,

Michael J. Pelsmajer

,

J. Graph Theory, 2003

Isometric cycles, cutsets, and crowning of bridged graphs.

[BibT_eX]

[DOI]

,

,

J. Graph Theory, 2003

Probabilistic Methods for Decomposition Dimension of Graphs.

[BibT_eX]

[DOI]

Mariko Hagita

,

André Kündgen

,

Graphs Comb., 2003

On the existence of Hamiltonian paths in the cover graph of M(n).

[BibT_eX]

[DOI]

Carla D. Savage

,

Ian Shields

,

Discret. Math., 2003

On the Erdos-Simonovits-So's Conjecture about the Anti-Ramsey Number of a Cycle.

[BibT_eX]

[DOI]

,

Comb. Probab. Comput., 2003

Problem 10967.

[BibT_eX]

[DOI]

Am. Math. Mon., 2002

The Chromatic Spectrum of Mixed Hypergraphs.

[BibT_eX]

[DOI]

,

,

,

,

Graphs Comb., 2002

Maximum Face-Constrained Coloring of Plane Graphs.

[BibT_eX]

[DOI]

Radhika Ramamurthi

,

Electron. Notes Discret. Math., 2002

Edge-Colorings of Complete Graphs that Avoid Polychromatic Trees.

[BibT_eX]

[DOI]

,

Electron. Notes Discret. Math., 2002

On restricted edge-colorings of bicliques.

[BibT_eX]

[DOI]

,

Discret. Math., 2002

A Fibonacci tiling of the plane.

[BibT_eX]

[DOI]

Charles W. Huegy

,

Discret. Math., 2002

Foreword.

[BibT_eX]

[DOI]

Lenore Cowen

,

Jerrold R. Griggs

,

Discret. Math., 2002

A Proof of the Two-path Conjecture.

[BibT_eX]

[DOI]

,

,

,

Electron. J. Comb., 2002

Structural Diagnosis of Wiring Networks: Finding Connected Components of Unknown Subgraphs.

[BibT_eX]

[DOI]

Weiping Shi

,

SIAM J. Discret. Math., 2001

Ramsey Theory and Bandwidth of Graphs.

[BibT_eX]

[DOI]

Zoltán Füredi

,

Graphs Comb., 2001

Realizing degree imbalances in directed graphs.

[BibT_eX]

[DOI]

,

Todd G. Will

,

Discret. Math., 2001

Correction to Edge-Bandwidth of Graphs.

[BibT_eX]

[DOI]

,

,

,

SIAM J. Discret. Math., 2000

Connected Domination and Spanning Trees with Many Leaves.

[BibT_eX]

[DOI]

Yair Caro

,

,

Raphael Yuster

SIAM J. Discret. Math., 2000

Multiple vertex coverings by specified induced subgraphs.

[BibT_eX]

[DOI]

Zoltán Füredi

,

,

J. Graph Theory, 2000

The edge-bandwidth of theta graphs.

[BibT_eX]

[DOI]

,

,

,

J. Graph Theory, 2000

On the Number of Vertices with Specified Eccentricity.

[BibT_eX]

[DOI]

,

Graphs Comb., 2000

A note on generalized chromatic number and generalized girth.

[BibT_eX]

[DOI]

Béla Bollobás

,

Discret. Math., 2000

Perfection thickness of graphs.

[BibT_eX]

[DOI]

,

,

,

Discret. Math., 2000

Edge-Bandwidth of Graphs.

[BibT_eX]

[DOI]

,

,

,

SIAM J. Discret. Math., 1999

Diagnosis of Wiring Networks: An Optimal Randomized Algorithm for Finding Connected Components of Unknown Graphs.

[BibT_eX]

[DOI]

Weiping Shi

,

SIAM J. Comput., 1999

Intersection representation of digraphs in trees with few leaves.

[BibT_eX]

[DOI]

In-Jen Lin

,

Malay K. Sen

,

J. Graph Theory, 1999

Coloring of trees with minimum sum of colors.

[BibT_eX]

[DOI]

,

J. Graph Theory, 1999

Chromatic spectrum is broken.

[BibT_eX]

[DOI]

,

,

,

,

Electron. Notes Discret. Math., 1999

A short proof that 'proper = unit'.

[BibT_eX]

[DOI]

Kenneth P. Bogart

,

Discret. Math., 1999

Star-factors of tournaments.

[BibT_eX]

[DOI]

Guantao Chen

,

Xiaoyun Lu

,

J. Graph Theory, 1998

The leafage of a chordal graph.

[BibT_eX]

[DOI]

In-Jen Lin

,

Terry A. McKee

,

Discuss. Math. Graph Theory, 1998

Short proofs for interval digraphs.

[BibT_eX]

[DOI]

Discret. Math., 1998

Line digraphs and coreflexive vertex sets.

[BibT_eX]

[DOI]

Xinming Liu

,

Discret. Math., 1998

Bandwidth and density for block graphs.

[BibT_eX]

[DOI]

,

,

,

Discret. Math., 1998

Total interval number for graphs with bounded degree.

[BibT_eX]

[DOI]

,

J. Graph Theory, 1997

The Number of Dependent Arcs in an Acyclic Orientation.

[BibT_eX]

[DOI]

,

,

,

J. Comb. Theory B, 1997

The Total Interval Number of a Graph II: Trees and Complexity.

[BibT_eX]

[DOI]

Thomas M. Kratzke

,

SIAM J. Discret. Math., 1996

The superregular graphs.

[BibT_eX]

[DOI]

J. Graph Theory, 1996

Large 2P3-free graphs with bounded degree.

[BibT_eX]

[DOI]

Myung S. Chung

,

Discret. Math., 1996

A Graph-Theoretic Game and Its Application to the k-Server Problem.

[BibT_eX]

[DOI]

,

,

,

SIAM J. Comput., 1995

Maximum Bandwidth Under Edge Addition.

[BibT_eX]

[DOI]

Jianfang Wang

,

,

Bing Yao

J. Graph Theory, 1995

The 2-intersection number of paths and bounded-degree trees.

[BibT_eX]

[DOI]

Michael S. Jacobson

,

André E. Kézdy

,

J. Graph Theory, 1995

Acyclic orientations of complete bipartite graphs.

[BibT_eX]

[DOI]

Discret. Math., 1995

Representing digraphs using intervals or circular arcs.

[BibT_eX]

[DOI]

Malay K. Sen

,

Barun K. Sanyal

,

Discret. Math., 1995

Interval number of special posets and random posets.

[BibT_eX]

[DOI]

Tom Madej

,

Discret. Math., 1995

Covering a Poset by Interval Orders.

[BibT_eX]

J. Comb. Theory A, 1994

Relaxed chromatic numbers of graphs.

[BibT_eX]

[DOI]

Margaret L. Weaver

,

Graphs Comb., 1994

Size, chromatic number, and connectivity.

[BibT_eX]

[DOI]

Jayaram Bhasker

,

Tariq Samad

,

Graphs Comb., 1994

The p-Intersection Number of a Complete Bipartite Graph and Orthogonal Double Coverings of a Clique.

[BibT_eX]

[DOI]

Myung S. Chung

,

Comb., 1994

Large P4-free graphs with bounded degree.

[BibT_eX]

[DOI]

Myung S. Chung

,

J. Graph Theory, 1993

Generating Linear Extensions by Adjacent Transpositions.

[BibT_eX]

[DOI]

J. Comb. Theory B, 1993

The total interval number of a graph, I: Fundamental classes.

[BibT_eX]

[DOI]

Thomas M. Kratzke

,

Discret. Math., 1993

Subtree and Substar Intersection Numbers.

[BibT_eX]

[DOI]

,

,

,

Discret. Appl. Math., 1993

Clique coverings of the edges of a random graph.

[BibT_eX]

[DOI]

,

,

,

Comb., 1993

Large regular graphs with no induced 2K2.

[BibT_eX]

[DOI]

,

,

,

Graphs Comb., 1992

Spanning Trees with Many Leaves.

[BibT_eX]

[DOI]

Daniel J. Kleitman

,

SIAM J. Discret. Math., 1991

The interval inclusion number of a partially ordered set.

[BibT_eX]

[DOI]

Tom Madej

,

Discret. Math., 1991

The maximum number of winning 2-sets.

[BibT_eX]

[DOI]

Discret. Appl. Math., 1991

Tetrahedrizing Point Sets in Three Dimensions.

[BibT_eX]

[DOI]

Herbert Edelsbrunner

,

Franco P. Preparata

,

J. Symb. Comput., 1990

Circular-arc digraphs: A characterization.

[BibT_eX]

[DOI]

Malay K. Sen

,

Sandip Das

,

J. Graph Theory, 1989

Interval digraphs: An analogue of interval graphs.

[BibT_eX]

[DOI]

,

,

,

J. Graph Theory, 1989

A length-width inequality for partially ordered sets with two-element cutsets.

[BibT_eX]

[DOI]

John Ginsburg

,

Bill Sands

,

J. Comb. Theory B, 1989

A short proof of the degree bound for interval number.

[BibT_eX]

[DOI]

Discret. Math., 1989

On the Construction of Communication Networks Satisfying Bounded Fan-In of Service Ports.

[BibT_eX]

[DOI]

,

Prithviraj Banerjee

IEEE Trans. Computers, 1988

Pagenumber of complete bipartite graphs.

[BibT_eX]

[DOI]

Douglas J. Muder

,

Margaret Lefevre Weaver

,

J. Graph Theory, 1988

The addition game: an abstraction of a communication problem.

[BibT_eX]

[DOI]

,

,

,

Discret. Math., 1988

An improved edge bound on the interval number of a graph.

[BibT_eX]

[DOI]

Jeremy P. Spinrad

,

Gopalakrishnan Vijayan

,

J. Graph Theory, 1987

Sorting by insertion of leading elements.

[BibT_eX]

[DOI]

Martin Aigner

,

J. Comb. Theory A, 1987

Unichain coverings in partial orders with the nested saturation property.

[BibT_eX]

[DOI]

Discret. Math., 1987

Poset boxicity of graphs.

[BibT_eX]

[DOI]

William T. Trotter

,

Discret. Math., 1987

Two easy duality theorems for product partial orders.

[BibT_eX]

[DOI]

Leslie E. Trotter Jr.

,

Discret. Appl. Math., 1987

"Poly-unsaturated" posets: The Greene-Kleitman theorem is best possible.

[BibT_eX]

[DOI]

J. Comb. Theory A, 1986

Election in a Complete Network with a Sense of Direction.

[BibT_eX]

[DOI]

Michael C. Loui

,

Teresa A. Matsushita

,

Inf. Process. Lett., 1986

Decomposition of product graphs into complete bipartite subgraphs.

[BibT_eX]

[DOI]

Bruce Reznick

,

Prasoon Tiwari

,

Discret. Math., 1985

A note on the interval number of a graph.

[BibT_eX]

[DOI]

Paul Erdös

,

Discret. Math., 1985

Recognizing graphs with fixed interval number is NP-complete.

[BibT_eX]

[DOI]

,

David B. Shmoys

Discret. Appl. Math., 1984

The interval number of a complete multipartite graph.

[BibT_eX]

[DOI]

Laurie B. Hopkins

,

William T. Trotter

,

Discret. Appl. Math., 1984

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

[BibT_eX]

[DOI]

,

,

,

Comb., 1984

Some Remarks on Normalized Matching.

[BibT_eX]

[DOI]

,

Lawrence H. Harper

,

David E. Daykin

J. Comb. Theory A, 1983

The interval number of a planar graph: Three intervals suffice.

[BibT_eX]

[DOI]

Edward R. Scheinerman

,

J. Comb. Theory B, 1983

A class of solutions to the gossip problem, part III.

[BibT_eX]

[DOI]

Discret. Math., 1982

A class of solutions to the gossip problem, part II.

[BibT_eX]

[DOI]

Discret. Math., 1982

A class of solutions to the gossip problem, part I.

[BibT_eX]

[DOI]

Discret. Math., 1982

Extremal Values of the Interval Number of a Graph.

[BibT_eX]

[DOI]

Jerrold R. Griggs

,

SIAM J. Algebraic Discret. Methods, 1980

A Symmetric Chain Decomposition of L(4, n).

[BibT_eX]

[DOI]

Eur. J. Comb., 1980

The Number of Meets between Two Subsets of a Lattice.

[BibT_eX]

[DOI]

David E. Daykin

,

Daniel J. Kleitman

,

J. Comb. Theory A, 1979

Skew chain orders and sets of rectangles.

[BibT_eX]

[DOI]