Colorable

Results: 22



#Item
1

One feature of good answers you will notice: they take a position and explain why it’s the best choice. I may disagree, but a colorable justification gets you a long way. Where there’s more than one “good” answe

Add to Reading List

Source URL: tushnet.files.wordpress.com

- Date: 2013-06-27 23:44:37
    2Graph coloring / Planar graph / Uniquely colorable graph / Interval edge coloring

    3-coloring triangle-free planar graphs with a precolored 9-cycle Ilkyoo Choi, Jan Ekstein, Pˇremysl Holub, Bernard Lidick´y Korea Advanced Institute of Science and Technology, Korea University of West Bohemia, Czech Re

    Add to Reading List

    Source URL: orion.math.iastate.edu

    Language: English - Date: 2015-01-31 11:27:16
    3

    Steinberg’s Conjecture Florian Hermanns September 5, 2013 Abstract Every planar graph without 4-cycles and 5-cycles is 3-colorable. This is Steinberg’s conjecture, proposed in 1976 by Richard Steinberg. It is listed

    Add to Reading List

    Source URL: www.math.ru.nl

    Language: English - Date: 2016-04-12 05:51:08
      4

      Dense triangle-free graphs are four-colorable: A solution to the Erd˝ os-Simonovits problem. Stephan Brandt∗ Technische Universit¨at Ilmenau Fakult¨at f¨

      Add to Reading List

      Source URL: perso.ens-lyon.fr

      Language: English - Date: 2011-08-22 06:36:00
        5

        An expected polynomial time algorithm for coloring 2-colorable 3-graphs Yury Person 1,2 Mathias Schacht 2 Institut f¨ ur Informatik Humboldt-Universit¨

        Add to Reading List

        Source URL: www.math.uni-frankfurt.de

        Language: English - Date: 2013-08-01 11:11:28
          6

          AN EXPECTED POLYNOMIAL TIME ALGORITHM FOR COLORING 2-COLORABLE 3-GRAPHS YURY PERSON AND MATHIAS SCHACHT Abstract. We present an algorithm that for 2-colorable 3-uniform hy-

          Add to Reading List

          Source URL: www.math.uni-frankfurt.de

          Language: English - Date: 2013-08-01 11:12:43
            7Graph coloring / Colorable / Uniquely colorable graph / Interval edge coloring

            On Coloring Resilient Graphs Jeremy Kun, Lev Reyzin University of Illinois at Chicago Department of Mathematics, Statistics, and Computer Science MFCS14, August 28, 2014

            Add to Reading List

            Source URL: www.levreyzin.com

            Language: English - Date: 2014-09-12 14:04:21
            8Graph theory / Graph coloring / Gadget / Planar graph / Uniquely colorable graph / Interval edge coloring

            LNCSOn Coloring Resilient Graphs

            Add to Reading List

            Source URL: www.levreyzin.com

            Language: English - Date: 2014-09-03 12:33:59
            9

            2-Colorable Perfect Matching is NP-complete [Schaefer 1978] Pushing 𝟏𝟏 × 𝟏𝟏 Blocks Pushing 𝟏𝟏 × 𝟏𝟏 Blocks

            Add to Reading List

            Source URL: courses.csail.mit.edu

            Language: English - Date: 2014-09-20 15:40:36
              10Theoretical computer science / Bricks / Construction / Mosaic / Symmetry / Tessellation / Colorable / Zonohedron / Polyhedron / Graph theory / Mathematics / Graph coloring

              CCCG 2003, Halifax, Nova Scotia, August 11–13, 2003 Coloring Objects Built From Bricks Suzanne Gallagher∗ Abstract

              Add to Reading List

              Source URL: www.cccg.ca

              Language: English - Date: 2004-01-08 18:44:32
              UPDATE