Smaller Planar Triangle-Free Graphs That Are Not 3-List-Colorable

Discrete Mathematics - Netherlands
doi 10.1016/j.disc.2004.10.015
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Elsevier BV

Related search

Triangle‐free Graphs That Do Not Contain an Induced Subdivision of K 4 Are 3‐colorable

Journal of Graph Theory
GeometryTopology
2018English

Triangle-Free Planar Graphs as Segments Intersection Graphs

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
1999English

On-Line 3-Chromatic Graphs I. Triangle-Free Graphs

SIAM Journal on Discrete Mathematics
Mathematics
1999English

Guessing Games on Triangle-Free Graphs

Electronic Journal of Combinatorics
CombinatoricsApplied MathematicsMathematicsGeometryDiscrete MathematicsComputational TheoryTopologyTheoretical Computer Science
2016English

Almost All K-Colorable Graphs Are Easy to Color

Journal of Algorithms
1988English

The Typical Structure of Maximal Triangle-Free Graphs

Forum of Mathematics, Sigma
StatisticsProbabilityAlgebraCombinatoricsAnalysisNumber TheoryGeometryMathematical PhysicsDiscrete MathematicsComputational MathematicsTheoretical Computer ScienceTopology
2015English

A Sufficient Condition for Planar Graphs With Maximum Degree 6 to Be Totally 8-Colorable

Discrete Applied Mathematics
CombinatoricsApplied MathematicsDiscrete Mathematics
2017English

A Sufficient Condition for Planar Graphs of Maximum Degree 6 to Be Totally 7-Colorable

Discrete Dynamics in Nature and Society
ModelingSimulation
2020English

Total Coloring of Claw-Free Planar Graphs

Discussiones Mathematicae - Graph Theory
CombinatoricsApplied MathematicsDiscrete Mathematics
2020English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2024 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy