Bruce A. Reed

Maya Stein

J. Graph Theory, April, 2023

Spanning trees in graphs of high minimum degree with a universal vertex I: An asymptotic result.

[BibT_eX]

[DOI]

Sebastián González Hermosillo de la Maza

Maya Stein

J. Graph Theory, April, 2023

2021

Cops and robbers on oriented toroidal grids.

[BibT_eX]

[DOI]

Seyyed Aliasghar Hosseini

Fiachra Knox

Bojan Mohar

Theor. Comput. Sci., 2021

Tight Bounds on the Clique Chromatic Number.

[BibT_eX]

[DOI]

Electron. J. Comb., 2021

The Speed and Threshold of the Biased Hamilton Cycle Game.

[BibT_eX]

[DOI]

Proceedings of the XI Latin and American Algorithms, Graphs and Optimization Symposium, 2021

The Speed and Threshold of the Biased Perfect Matching Game.

[BibT_eX]

[DOI]

Proceedings of the XI Latin and American Algorithms, Graphs and Optimization Symposium, 2021

Partitioning Into Prescribed Number of Cycles and Mod k T-join With Slack.

[BibT_eX]

[DOI]

Proceedings of the XI Latin and American Algorithms, Graphs and Optimization Symposium, 2021

2020

A variant of the Erdős-Sós conjecture.

[BibT_eX]

[DOI]

J. Graph Theory, 2020

Corrigendum to "Bisimplicial vertices in even-hole-free graphs".

[BibT_eX]

[DOI]

J. Comb. Theory B, 2020

Notes on Tree- and Path-chromatic Number.

[BibT_eX]

[DOI]

CoRR, 2020

A Lower Bound on the Average Degree Forcing a Minor.

[BibT_eX]

[DOI]

Electron. J. Comb., 2020

2019

Notes on growing a tree in a graph.

[BibT_eX]

[DOI]

Random Struct. Algorithms, 2019

Near-domination in graphs.

[BibT_eX]

[DOI]

Alex Scott

J. Comb. Theory A, 2019

Finding Maximal Sets of Laminar 3-Separators in Planar Graphs in Linear Time.

[BibT_eX]

[DOI]

David Eppstein

Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2019

2018

Polyhedral results on the stable set problem in graphs containing even or odd pairs.

[BibT_eX]

[DOI]

Jonas T. Witt

Marco E. Lübbecke

Math. Program., 2018

Almost All String Graphs are Intersection Graphs of Plane Convex Sets.

[BibT_eX]

[DOI]

János Pach

Yelena Yuditsky

Proceedings of the 34th International Symposium on Computational Geometry, 2018

2017

Acyclic edge colourings of graphs with large girth.

[BibT_eX]

[DOI]

Random Struct. Algorithms, 2017

Existence of Spanning ℱ-Free Subgraphs with Large Minimum Degree.

[BibT_eX]

[DOI]

Guillem Perarnau

Comb. Probab. Comput., 2017

2016

A Short Proof That χ Can be Bounded ε Away from Δ + 1 toward ω.

[BibT_eX]

[DOI]

J. Graph Theory, 2016

'Forcing a sparse minor' - CORRIGENDUM.

[BibT_eX]

[DOI]

Comb. Probab. Comput., 2016

Forcing a sparse minor.

[BibT_eX]

[DOI]

Comb. Probab. Comput., 2016

How to Determine if a Random Graph with a Fixed Degree Sequence Has a Giant Component.

[BibT_eX]

[DOI]

Proceedings of the IEEE 57th Annual Symposium on Foundations of Computer Science, 2016

2015

Excluding a Substar and an Antisubstar.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2015

A Proof of a Conjecture of Ohba.

[BibT_eX]

[DOI]

Jonathan A. Noel

Hehui Wu

J. Graph Theory, 2015

Claw-Free Graphs, Skeletal Graphs, and a Stronger Conjecture on ω, Δ, and χ.

[BibT_eX]

[DOI]

J. Graph Theory, 2015

Connectivity Preserving Iterative Compaction and Finding 2 Disjoint Rooted Paths in Linear Time.

[BibT_eX]

[DOI]

CoRR, 2015

Connectivity Preserving Iterative Compression.

[BibT_eX]

[DOI]

Proceedings of the 27th Canadian Conference on Computational Geometry, 2015

2014

For most graphs H, most H-free graphs have a linear homogeneous set.

[BibT_eX]

[DOI]

Random Struct. Algorithms, 2014

Colouring graphs when the number of colours is almost the maximum degree.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2014

Removable paths and cycles with parity constraints.

[BibT_eX]

[DOI]

Orlando Lee

J. Comb. Theory B, 2014

2013

Digraph Girth via Chromatic Number.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2013

A Linear-Time Algorithm for Finding a Complete Graph Minor in a Dense Graph.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2013

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

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2013

Oriented trees in digraphs.

[BibT_eX]

[DOI]

Frédéric Havet

Stéphan Thomassé

Discret. Math., 2013

A Simple Algorithm for the Graph Minor Decomposition - Logic meets Structural Graph Theory.

[BibT_eX]

[DOI]

Martin Grohe

Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms, 2013

2012

Griggs and Yeh's Conjecture and L(p, 1)-labelings.

[BibT_eX]

[DOI]

Frédéric Havet

Jean-Sébastien Sereni

SIAM J. Discret. Math., 2012

The disjoint paths problem in quadratic time.

[BibT_eX]

[DOI]

Yusuke Kobayashi

J. Comb. Theory B, 2012

Polynomial treewidth forces a large grid-like-minor.

[BibT_eX]

[DOI]

Eur. J. Comb., 2012

Polynomial-time recognition of clique-width ≤3 graphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2012

Connectivity for Bridge-Addable Monotone Graph Classes.

[BibT_eX]

[DOI]

Comb. Probab. Comput., 2012

A short proof that χ can be bounded ε away from Δ+1 towards ω

[BibT_eX]

[DOI]

CoRR, 2012

2011

The edge-density for K2, t minors.

[BibT_eX]

[DOI]

Maria Chudnovsky

J. Comb. Theory B, 2011

Graph Coloring via The Probabilistic Method.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete Algorithms, 2011

The Graph Minor Algorithm with Parity Conditions.

[BibT_eX]

[DOI]

Paul Wollan

Proceedings of the IEEE 52nd Annual Symposium on Foundations of Computer Science, 2011

2010

Corrigendum to "Asymptotically optimal frugal colouring" [J. Combin. Theory Ser. B 100 (2) (2010) 226-246].

[BibT_eX]

[DOI]

J. Comb. Theory B, 2010

Finding a maximum-weight induced k-partite subgraph of an i-triangulated graph.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2010

Odd cycle packing.

[BibT_eX]

[DOI]

Proceedings of the 42nd ACM Symposium on Theory of Computing, 2010

An (almost) Linear Time Algorithm for Odd Cyles Transversal.

[BibT_eX]

[DOI]

Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms, 2010

Recognizing a Totally Odd K4-subdivision, Parity 2-disjoint Rooted Paths and a Parity Cycle Through Specified Elements.

[BibT_eX]

[DOI]

Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms, 2010

A Separator Theorem in Minor-Closed Classes.

[BibT_eX]

[DOI]

Proceedings of the 51th Annual IEEE Symposium on Foundations of Computer Science, 2010

2009

Coloring Artemis graphs.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2009

A linear-time algorithm to find a separator in a graph excluding a minor.

[BibT_eX]

[DOI]

ACM Trans. Algorithms, 2009

Critical random graphs and the structure of a minimum spanning tree.

[BibT_eX]

[DOI]

Nicolas Broutin

Random Struct. Algorithms, 2009

Removable cycles in non-bipartite graphs.

[BibT_eX]

[DOI]

Orlando Lee

J. Comb. Theory B, 2009

On the odd-minor variant of Hadwiger's conjecture.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2009

Fractionally Edge Colouring Graphs with Large Maximum Degree in Linear Time.

[BibT_eX]

[DOI]

W. Sean Kennedy

Conor Meagher

Electron. Notes Discret. Math., 2009

A Characterization of Graphs with Fractional Total Chromatic Number Equal to Delta+2.

[BibT_eX]

[DOI]

Takehiro Ito

W. Sean Kennedy

Electron. Notes Discret. Math., 2009

A general critical condition for the emergence of a giant component in random graphs with given degrees.

[BibT_eX]

[DOI]

Nikolaos Fountoulakis

Electron. Notes Discret. Math., 2009

Tree-width of graphs without a 3×3 grid minor.

[BibT_eX]

[DOI]

Etienne Birmelé

J. Adrian Bondy

Discret. Appl. Math., 2009

Highly parity linked graphs.

[BibT_eX]

[DOI]

Comb., 2009

Hadwiger's conjecture is decidable.

[BibT_eX]

[DOI]

Proceedings of the 41st Annual ACM Symposium on Theory of Computing, 2009

Asymptotically optimal frugal colouring.

[BibT_eX]

[DOI]

Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2009

A nearly linear time algorithm for the half integral parity disjoint paths packing problem.

[BibT_eX]

[DOI]

Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2009

2008

On Planar Quasi-Parity Graphs.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2008

The evolution of the mixing rate of a simple random walk on the giant component of a random graph.

[BibT_eX]

[DOI]

Nikolaos Fountoulakis

Random Struct. Algorithms, 2008

Bounding chi in terms of omega and delta for quasi-line graphs.

[BibT_eX]

[DOI]

J. Graph Theory, 2008

A weaker version of Lovász' path removal conjecture.

[BibT_eX]

[DOI]

Orlando Lee

Paul Wollan

J. Comb. Theory B, 2008

Bisimplicial vertices in even-hole-free graphs.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2008

List Colouring Constants of Triangle Free Graphs.

[BibT_eX]

[DOI]

Omid Amini

Electron. Notes Discret. Math., 2008

Fractional coloring and the odd Hadwiger's conjecture.

[BibT_eX]

[DOI]

Eur. J. Comb., 2008

Skew partitions in perfect graphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2008

Partition into cliques for cubic graphs: Planar case, complexity and approximation.

[BibT_eX]

[DOI]

Márcia R. Cerioli

Luérbio Faria

Talita O. Ferreira

Carlos A. J. Martinhon

Fábio Protti

Discret. Appl. Math., 2008

On the Maximum Degree of a Random Planar Graph.

[BibT_eX]

[DOI]

Comb. Probab. Comput., 2008

A nearly linear time algorithm for the half integral disjoint paths packing.

[BibT_eX]

[DOI]

Proceedings of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2008

L(2, 1)-labelling of graphs.

[BibT_eX]

[DOI]

Frédéric Havet

Jean-Sébastien Sereni

Proceedings of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2008

Optimization and Recognition for K 5-minor Free Graphs in Linear Time.

[BibT_eX]

[DOI]

Proceedings of the LATIN 2008: Theoretical Informatics, 2008

A Simpler Linear Time Algorithm for Embedding Graphs into an Arbitrary Surface and the Genus of Graphs of Bounded Tree-Width.

[BibT_eX]

[DOI]

Bojan Mohar

Proceedings of the 49th Annual IEEE Symposium on Foundations of Computer Science, 2008

2007

Vašek Chvátal: A Very Short Introduction.

[BibT_eX]

[DOI]

Graphs Comb., 2007

Asymptotics of the chromatic number for quasi-line graphs.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2007

List Colouring Squares of Planar Graphs.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2007

An upper bound for the chromatic number of line graphs.

[BibT_eX]

[DOI]

Adrian Vetta

Eur. J. Comb., 2007

The Erdös-Pósa Property For Long Circuits.

[BibT_eX]

[DOI]

Etienne Birmelé

J. Adrian Bondy

Comb., 2007

Vertex-Colouring Edge-Weightings.

[BibT_eX]

[DOI]

Comb., 2007

Computing crossing number in linear time.

[BibT_eX]

[DOI]

Proceedings of the 39th Annual ACM Symposium on Theory of Computing, 2007

Domination in Cubic Graphs of Large Girth.

[BibT_eX]

[DOI]

Dieter Rautenbach

Proceedings of the Computational Geometry and Graph Theory, 2007

Fast Skew Partition Recognition.

[BibT_eX]

[DOI]

William S. Kennedy

Proceedings of the Computational Geometry and Graph Theory, 2007

Properly 2-Colouring Linear Hypergraphs.

[BibT_eX]

[DOI]

Arkadev Chattopadhyay

Proceedings of the Approximation, 2007

2006

Concentration for self-bounding functions and an inequality of Talagrand.

[BibT_eX]

[DOI]

Random Struct. Algorithms, 2006

2005

On the fractional chromatic index of a graph and its complement.

[BibT_eX]

[DOI]

David Avis

Caterina De Simone

Oper. Res. Lett., 2005

(Delta-k)-critical graphs.

[BibT_eX]

[DOI]

Babak Farzad

Michael S. O. Molloy

J. Comb. Theory B, 2005

Vertex colouring edge partitions.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2005

The perfection and recognition of bull-reducible Berge graphs.

[BibT_eX]

[DOI]

RAIRO Theor. Informatics Appl., 2005

Fractionally total colouring Gn, p.

[BibT_eX]

[DOI]

Conor Meagher

Electron. Notes Discret. Math., 2005

Planar graph bipartization in linear time.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2005

Degree constrained subgraphs.

[BibT_eX]

[DOI]

Ketan Dalal

Electron. Notes Discret. Math., 2005

Heap Building Bounds.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Data Structures, 9th International Workshop, 2005

Approximate Min-max Relations for Odd Cycles in Planar Graphs.

[BibT_eX]

[DOI]

Proceedings of the Integer Programming and Combinatorial Optimization, 2005

2004

On the Co-P3-Structure of Perfect Graphs.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2004

Finding odd cycle transversals.

[BibT_eX]

[DOI]

Kaleigh Smith

Adrian Vetta

Oper. Res. Lett., 2004

Excluding any graph as a minor allows a low tree-width 2-coloring.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2004

Hadwiger's conjecture for line graphs.

[BibT_eX]

[DOI]

Eur. J. Comb., 2004

Preface.

[BibT_eX]

[DOI]

Siang W. Song

Jayme Luiz Szwarcfiter

Discret. Appl. Math., 2004

Stable skew partition problem.

[BibT_eX]

[DOI]

Simone Dantas

Sylvain Gravier

Discret. Appl. Math., 2004

List Colouring When The Chromatic Number Is Close To the Order Of The Graph.

[BibT_eX]

[DOI]

Benny Sudakov

Comb., 2004

2003

Multicuts in unweighted graphs and digraphs with bounded degree and bounded tree-width.

[BibT_eX]

[DOI]

Gruia Calinescu

Cristina G. Fernandes

J. Algorithms, 2003

The height of a random binary search tree.

[BibT_eX]

[DOI]

J. ACM, 2003

Channel assignment on graphs of bounded treewidth.

[BibT_eX]

[DOI]

Discret. Math., 2003

A note on random homomorphism from arbitrary graphs to Z.

[BibT_eX]

[DOI]

Martin Loebl

Jaroslav Nesetril

Discret. Math., 2003

2002

Asymptotically the List Colouring Constants Are 1.

[BibT_eX]

[DOI]

Benny Sudakov

J. Comb. Theory B, 2002

Random Regular Graphs Of Non-Constant Degree: Independence And Chromatic Number.

[BibT_eX]

[DOI]

Comb. Probab. Comput., 2002

Random Regular Graphs Of Non-Constant Degree: Connectivity And Hamiltonicity.

[BibT_eX]

[DOI]

Colin Cooper

Comb. Probab. Comput., 2002

Polynomial time recognition of P4-structure.

[BibT_eX]

[DOI]

Ryan B. Hayward

Stefan Hougardy

Proceedings of the Thirteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2002

2001

Recognizing Planar Strict Quasi-Parity Graphs.

[BibT_eX]

[DOI]

Graphs Comb., 2001

Channel Assignment on Nearly Bipartite and Bounded Treewidth Graphs.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2001

A note on Random Homomorphism from ArbitraryGraphs to Z.

[BibT_eX]

[DOI]

Martin Loebl

Jaroslav Nesetril

Electron. Notes Discret. Math., 2001

Bull-Reducible Berge Graphs are Perfect.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2001

The Erdos-Pósa Property for Odd Cycles in Highly Connected Graphs.

[BibT_eX]

[DOI]

Dieter Rautenbach

Comb., 2001

On Star Coloring of Graphs.

[BibT_eX]

[DOI]

Guillaume Fertin

André Raspaud

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2001

Colouring graphs when the number of colours is nearly the maximum degree.

[BibT_eX]

[DOI]

Proceedings of the Proceedings on 33rd Annual ACM Symposium on Theory of Computing, 2001

Approximately covering by cycles in planar graphs.

[BibT_eX]

[DOI]

Dieter Rautenbach

Proceedings of the Twelfth Annual Symposium on Discrete Algorithms, 2001

2000

Near-optimal list colorings.

[BibT_eX]

[DOI]

Random Struct. Algorithms, 2000

Channel assignment and weighted coloring.

[BibT_eX]

[DOI]

Networks, 2000

Clique Minors in Graphs and Their Complements.

[BibT_eX]

[DOI]

Robin Thomas

J. Comb. Theory B, 2000

k-Colouring when k is close to Delta.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2000

Optimal packings of edge-disjoint odd cycles.

[BibT_eX]

[DOI]

Claude Berge

Discret. Math., 2000

How tall is a tree?

[BibT_eX]

[DOI]

Proceedings of the Thirty-Second Annual ACM Symposium on Theory of Computing, 2000

Finding Skew Partitions Efficiently.

[BibT_eX]

[DOI]

Yoshiharu Kohayakawa

Proceedings of the LATIN 2000: Theoretical Informatics, 2000

Polynomial Time Recognition of Clique-Width \le \leq 3 Graphs (Extended Abstract).

[BibT_eX]

[DOI]

Proceedings of the LATIN 2000: Theoretical Informatics, 2000

1999

Edge coloring nearly bipartite graphs.

[BibT_eX]

[DOI]

Oper. Res. Lett., 1999

The list colouring constants.

[BibT_eX]

[DOI]

J. Graph Theory, 1999

A note on vertex orders for stability number.

[BibT_eX]

[DOI]

Nadimpalli V. R. Mahadev

J. Graph Theory, 1999

A Strengthening of Brooks' Theorem.

[BibT_eX]

[DOI]

J. Comb. Theory B, 1999

A Description of Claw-Free Perfect Graphs.

[BibT_eX]

[DOI]

J. Comb. Theory B, 1999

Introducing Directed Tree Width.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 1999

Colouring proximity graphs in the plane.

[BibT_eX]

[DOI]

Discret. Math., 1999

Critical Subgraphs of a Random Graph.

[BibT_eX]

[DOI]

Electron. J. Comb., 1999

Mangoes and Blueberries.

[BibT_eX]

[DOI]

Comb., 1999

An Improved Algorithm for Finding Tree Decompositions of Small Width.

[BibT_eX]

[DOI]

Ljubomir Perkovic

Proceedings of the Graph-Theoretic Concepts in Computer Science, 1999

1998

Total Coloring With Delta + (log Delta) Colors.

[BibT_eX]

[DOI]

Hugh Hind

SIAM J. Comput., 1998

ω, Δ, and χ.

[BibT_eX]

[DOI]

J. Graph Theory, 1998

Fractional Colouring and Hadwiger's Conjecture.

[BibT_eX]

[DOI]

J. Comb. Theory B, 1998

The Size of the Giant Component of a Random Graph with a Given Degree Sequence.

[BibT_eX]

[DOI]

Comb. Probab. Comput., 1998

A Bound on the Total Chromatic Number.

[BibT_eX]

[DOI]

Comb., 1998

Further Algorithmic Aspects of the Local Lemma.

[BibT_eX]

[DOI]

Proceedings of the Thirtieth Annual ACM Symposium on the Theory of Computing, 1998

Colouring Graphs whose Chromatic Number Is Almost Their Maximum Degree.

[BibT_eX]

[DOI]

Proceedings of the LATIN '98: Theoretical Informatics, 1998

Multicuts in Unweighted Graphs with Bounded Degree and Bounded Tree-Width.

[BibT_eX]

[DOI]

Gruia Calinescu

Cristina G. Fernandes

Proceedings of the Integer Programming and Combinatorial Optimization, 1998

1997

A Bound on the Strong Chromatic Index of a Graph, .

[BibT_eX]

[DOI]

J. Comb. Theory B, 1997

On Planar Perfectly Contractile Graphs.

[BibT_eX]

[DOI]

Graphs Comb., 1997

Edge coloring regular graphs of high degree.

[BibT_eX]

[DOI]

Ljubomir Perkovic

Discret. Math., 1997

Path parity and perfection.

[BibT_eX]

[DOI]

Oscar Porto

Discret. Math., 1997

An Algorithm for Finding Homogeneous Pairs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 1997

Colouring a Graph Frugally.

[BibT_eX]

[DOI]

Hugh Hind

Comb., 1997

On the mixing rate of the triangulation walk.

[BibT_eX]

[DOI]

Michael S. O. Molloy

William Steiger

Proceedings of the Randomization Methods in Algorithm Design, 1997

1996

beta-Perfect Graphs.

[BibT_eX]

[DOI]

S. E. Markossian

G. S. Gasparian

J. Comb. Theory B, 1996

Paths, Stars and the Number Three.

[BibT_eX]

[DOI]

Comb. Probab. Comput., 1996

Perfect Matchings in Random r-regular, s-uniform Hypergraphs.

[BibT_eX]

[DOI]

Comb. Probab. Comput., 1996

The Gallai-Younger Conjecture for Planar Graphs.

[BibT_eX]

[DOI]

F. Bruce Shepherd

Comb., 1996

Packing Directed Circuits.

[BibT_eX]

[DOI]

Comb., 1996

1995

On the Variance of the Height of Random Binary Search Trees.

[BibT_eX]

[DOI]

Luc Devroye

SIAM J. Comput., 1995

A Critical Point for Random Graphs with a Given Degree Sequence.

[BibT_eX]

[DOI]

Random Struct. Algorithms, 1995

The Dominating Number of Random Cubic Graph.

[BibT_eX]

[DOI]

Random Struct. Algorithms, 1995

Recognizing bull-free perfect graphs.

[BibT_eX]

[DOI]

Najiba Sbihi

Graphs Comb., 1995

Right angle free subsets in the plane.

[BibT_eX]

[DOI]

B. Gamble

William R. Pulleyblank

F. Bruce Shepherd

Graphs Comb., 1995

Rooted Routing in the Plane.

[BibT_eX]

[DOI]

Discret. Appl. Math., 1995

Almost Every Graph can be Covered by [fracDelta2] Linear Forests.

[BibT_eX]

[DOI]

Comb. Probab. Comput., 1995

Multicoloured Hamilton Cycles.

[BibT_eX]

[DOI]

Michael H. Albert

Electron. J. Comb., 1995

Covering the Edges of a Random Graph by Cliques.

[BibT_eX]

[DOI]

Comb., 1995

1994

Induced Circuits in Planar Graphs.

[BibT_eX]

[DOI]

Colin J. H. McDiarmid

Alexander Schrijver

F. Bruce Shepherd

J. Comb. Theory B, 1994

1993

On Total Colorings of Graphs.

[BibT_eX]

[DOI]

Colin J. H. McDiarmid

J. Comb. Theory B, 1993

Complete Multi-partite Cutsets in Minimal Imperfect Graphs.

[BibT_eX]

[DOI]

Gérard Cornuéjols

J. Comb. Theory B, 1993

Polychromatic Hamilton cycles.

[BibT_eX]

[DOI]

Discret. Math., 1993

Fractionally colouring total graphs.

[BibT_eX]

[DOI]

Kyriakos Kilakos

Comb., 1993

1992

The Strongly Connected Components of 1-in, 1-out.

[BibT_eX]

[DOI]

Comb. Probab. Comput., 1992

Star arboricity.

[BibT_eX]

[DOI]

Noga Alon

Comb., 1992

Non-Interfering Network Flows.

[BibT_eX]

[DOI]

Proceedings of the Algorithm Theory, 1992

Finding Approximate Separators and Computing Tree Width Quickly

[BibT_eX]

[DOI]

Proceedings of the 24th Annual ACM Symposium on Theory of Computing, 1992

When is the Assignment Bound Tight for the Asymmetric Traveling Salesman Problem?

[BibT_eX]

Richard M. Karp

Proceedings of the 2nd Integer Programming and Combinatorial Optimization Conference, 1992

Mick Gets Some (the Odds Are on His Side)

[BibT_eX]

[DOI]

Vasek Chvátal

Proceedings of the 33rd Annual Symposium on Foundations of Computer Science, 1992

1991

Acyclic Coloring of Graphs.

[BibT_eX]

[DOI]

Noga Alon

Random Struct. Algorithms, 1991

Finding disjoint trees in planar graphs in linear time.

[BibT_eX]

Proceedings of the Graph Structure Theory, 1991

Counterexamples to a conjecture of Las Vergnas and Meyniel.

[BibT_eX]

Proceedings of the Graph Structure Theory, 1991

An extremal function for the achromatic number.

[BibT_eX]

Béla Bollobás

Andrew Thomason

Proceedings of the Graph Structure Theory, 1991

1990

Greedy Matching on the Line.

[BibT_eX]

[DOI]

SIAM J. Comput., 1990

Linear Arboricity of Random Regular Graphs.

[BibT_eX]

[DOI]

Random Struct. Algorithms, 1990

Perfection, Parity, Planarity, and Packing Paths.

[BibT_eX]

Proceedings of the 1st Integer Programming and Combinatorial Optimization Conference, 1990

1989

Some classes of perfectly orderable graphs.

[BibT_eX]

[DOI]

J. Graph Theory, 1989

Building Heaps Fast.

[BibT_eX]

[DOI]

J. Algorithms, 1989

P4-comparability graphs.

[BibT_eX]

[DOI]

Discret. Math., 1989

1988

Threshold tolerance graphs.

[BibT_eX]

[DOI]

Clyde L. Monma

William T. Trotter

J. Graph Theory, 1988

Edge-colouring random graphs.

[BibT_eX]

[DOI]

Bill Jackson

Colin J. H. McDiarmid

J. Comb. Theory B, 1988

1987

A semi-strong Perfect Graph theorem.

[BibT_eX]

[DOI]

J. Comb. Theory B, 1987

A note on even pairs.

[BibT_eX]

[DOI]

Discret. Math., 1987

A note on short cycles in diagraphs.

[BibT_eX]

[DOI]

Discret. Math., 1987

1985

A note on the semi-strong perfect graph conjecture.

[BibT_eX]

[DOI]