Bruce Reed

Results: 33



#Item
1A Proof of a Conjecture of Ohba Jonathan A. Noel, Bruce A. Reed, Hehui Wu August 1, 2012 Abstract We prove a conjecture of Ohba which says that every graph G on at most 2χ(G) + 1 vertices satisfies χ` (G) = χ(G).

A Proof of a Conjecture of Ohba Jonathan A. Noel, Bruce A. Reed, Hehui Wu August 1, 2012 Abstract We prove a conjecture of Ohba which says that every graph G on at most 2χ(G) + 1 vertices satisfies χ` (G) = χ(G).

Add to Reading List

Source URL: people.maths.ox.ac.uk

Language: English - Date: 2012-08-01 15:35:50
    2Almost all H-free graphs have the Erd˝os-Hajnal property Martin Loebl∗, Bruce Reed†, Alex Scott‡, Andrew Thomason§and St´ephan Thomass´e¶ Abstract

    Almost all H-free graphs have the Erd˝os-Hajnal property Martin Loebl∗, Bruce Reed†, Alex Scott‡, Andrew Thomason§and St´ephan Thomass´e¶ Abstract

    Add to Reading List

    Source URL: perso.ens-lyon.fr

    Language: English - Date: 2011-08-22 06:36:00
      3Oriented trees in digraphs Louigi Addario-Berry∗ Fr´ed´eric Havet Bruce Reed

      Oriented trees in digraphs Louigi Addario-Berry∗ Fr´ed´eric Havet Bruce Reed

      Add to Reading List

      Source URL: perso.ens-lyon.fr

      Language: English - Date: 2011-08-22 06:36:01
        4The Height of a Random Binary Search Tree BRUCE REED McGill University, Montreal Quebec, Canada and CNRS, Paris, France Abstract. Let Hn be the height of a random binary search tree on n nodes. We show that there exist c

        The Height of a Random Binary Search Tree BRUCE REED McGill University, Montreal Quebec, Canada and CNRS, Paris, France Abstract. Let Hn be the height of a random binary search tree on n nodes. We show that there exist c

        Add to Reading List

        Source URL: cgm.cs.mcgill.ca

        Language: English - Date: 2003-09-12 14:05:29
          5Journal of Combinatorial Theory, Series B 86, 27–doi:jctbAsymptotically the List Colouring Constants Are1 Bruce Reed CNRS, Paris, France; and School of Computer Science, McGill University,

          Journal of Combinatorial Theory, Series B 86, 27–doi:jctbAsymptotically the List Colouring Constants Are1 Bruce Reed CNRS, Paris, France; and School of Computer Science, McGill University,

          Add to Reading List

          Source URL: cgm.cs.mcgill.ca

          Language: English - Date: 2003-09-12 13:36:00
            6L(p,1)-labelling of graphs∗ Fr´ed´eric Havet 1, Bruce Reed 1,2 and Jean-S´ebastien Sereni 3,4 1 2

            L(p,1)-labelling of graphs∗ Fr´ed´eric Havet 1, Bruce Reed 1,2 and Jean-S´ebastien Sereni 3,4 1 2

            Add to Reading List

            Source URL: iti.mff.cuni.cz

            Language: English - Date: 2016-02-04 05:53:37
              7Existence of spanning F-free subgraphs with large minimum degree Guillem Perarnau∗ Bruce Reed† arXiv:1404.7764v1 [math.CO] 30 Apr 2014

              Existence of spanning F-free subgraphs with large minimum degree Guillem Perarnau∗ Bruce Reed† arXiv:1404.7764v1 [math.CO] 30 Apr 2014

              Add to Reading List

              Source URL: arxiv.org

              Language: English - Date: 2014-04-30 20:22:30
                8Finding the maximum-weight induced k-partite subgraph of an i-triangulated graph Louigi Addario-Berry, William S. Kennedy, Andrew D. King, Zhentao Li, and Bruce Reed September 24, 2006 Abstract

                Finding the maximum-weight induced k-partite subgraph of an i-triangulated graph Louigi Addario-Berry, William S. Kennedy, Andrew D. King, Zhentao Li, and Bruce Reed September 24, 2006 Abstract

                Add to Reading List

                Source URL: cgm.cs.mcgill.ca

                Language: English - Date: 2008-11-07 17:40:38
                  9Mathematics-in-Industry Case Studies Journal, Volume 1, ppPainting the Office Bruce Reed ∗

                  Mathematics-in-Industry Case Studies Journal, Volume 1, ppPainting the Office Bruce Reed ∗

                  Add to Reading List

                  Source URL: www.fields.utoronto.ca

                  Language: English - Date: 2015-03-23 09:45:42
                  10Bounding χ in terms of ω and ∆ for quasi-line graphs Andrew King and Bruce Reed May 8, 2007 Abstract A quasi-line graph is a graph in which the neighbourhood of any vertex

                  Bounding χ in terms of ω and ∆ for quasi-line graphs Andrew King and Bruce Reed May 8, 2007 Abstract A quasi-line graph is a graph in which the neighbourhood of any vertex

                  Add to Reading List

                  Source URL: andrewdouglasking.com.s3-website-us-west-2.amazonaws.com

                  Language: English - Date: 2015-03-20 01:35:25