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

Journal of Graph Theory - United States
doi 10.1002/jgt.22441
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Wiley

Related search

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

Discrete Mathematics
CombinatoricsTheoretical Computer ScienceDiscrete Mathematics
2005English

On Graphs and Algebraic Graphs That Do Not Contain Cycles of Length 4

Journal of Graph Theory
GeometryTopology
2010English

Almost All K-Colorable Graphs Are Easy to Color

Journal of Algorithms
1988English

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

SIAM Journal on Discrete Mathematics
Mathematics
1999English

Coloring Random and Semi-Random K-Colorable Graphs

Journal of Algorithms
1995English

Triangle-Free Planar Graphs as Segments Intersection Graphs

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
1999English

An Expected Polynomial Time Algorithm for Coloring 2-Colorable 3-Graphs

Electronic Notes in Discrete Mathematics
CombinatoricsApplied MathematicsDiscrete Mathematics
2009English

Guessing Games on Triangle-Free Graphs

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

The Typical Structure of Maximal Triangle-Free Graphs

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

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy