2-List-coloring planar graphs without monochromatic triangles

A Cantor-Bernstein Theorem for Paths in Graphs

A Hamiltonian Cycle in the Square of a 2-connected Graph in Linear Time

A Link Between the Jordan Curve Theorem and the Kuratowski Planarity Criterion

article by Carsten Thomassen published March 1990 in American Mathematical Monthly

A short list color proof of Grötzsch's theorem

An intersection graph of straight lines

Anticritical graphs

scientific article published in January 1976

Chords in longest cycles

Chromatic Roots and Hamiltonian Paths

Classification Of Locally 2-Connected Compact Metric Spaces

article

Coloring triangle-free graphs with fixed size

scientific article (publication date: May 2000)

Cycles through all finite vertex sets in infinite graphs

Deciding Parity of Graph Crossing Number

Decomposing a Planar Graph into an Independent Set and a 3-Degenerate Graph

Decomposing a graph into bistars

Decomposing a planar graph of girth 5 into an independent set and a forest

Decomposing graphs into a constant number of locally irregular subgraphs

Decomposing graphs into paths of fixed length

Decompositions of highly connected graphs into paths of length 3

article

Density Conditions For Triangles In Multipartite Graphs

Density of Chromatic Roots in Minor-Closed Graph Families

Destroying longest cycles in graphs and digraphs

scholarly article by Susan A. van Aardt et al published May 2015 in Discrete Applied Mathematics

Dirac's conjecture on K5-subdivisions

Edge-decompositions of highly connected graphs into paths

Edge-disjoint Hamiltonian cycles in hypertournaments

Erratum to: Commentary for “On planarity of compact, locally connected, metric spaces”

scholarly article published in Combinatorica

Every Planar Graph Is 5-Choosable

Exponentially many 5-list-colorings of planar graphs

Finite metric spaces of strictly negative type

scientific article published in February 1998

From the plane to higher surfaces

Graph factors modulo k

Graph-like continua, augmenting arcs, and Menger’s theorem

Graphs with not all possible path-kernels

Group flow, complex flow, unit vector flow, and the(2+ϵ)-flow conjecture

Group-colouring, group-connectivity, claw-decompositions, and orientations in 5-edge-connected planar graphs

Hamiltonian-connected tournaments

Infinitely connected subgraphs in graphs of uncountable chromatic number

Kuratowski's theorem

Liftings in Finite Graphs and Linkages in Infinite Graphs with Prescribed Edge-Connectivity

Many 3-colorings of triangle-free planar graphs

Nash-Williams’ cycle-decomposition theorem

scientific article

Nowhere-zero 3-flows and modulo k -orientations

On The Chromatic Number Of Pentagon-Free Graphs Of Large Minimum Degree

On planarity of compact, locally connected, metric spaces

On the Chromatic Number of Triangle-Free Graphs of Large Minimum Degree

On the Complexity of Some Colorful Problems Parameterized by Treewidth

On the Minimum Number of Spanning Trees ink-Edge-Connected Graphs

On the Nelson Unit Distance Coloring Problem

On the complexity of some colorful problems parameterized by treewidth

On the maximum number of cycles in a planar graph

Orientations of infinite graphs with prescribed edge-connectivity

Planar and infinite hypohamiltonian and hypotraceable graphs

Relations Between Crossing Numbers of Complete and Complete Bipartite Graphs

article by R. Bruce Richter & Carsten Thomassen published February 1997 in American Mathematical Monthly

Spanning quadrangulations of triangulated surfaces

Strongly 2-connected orientations of graphs

Switchings, extensions, and reductions in central digraphs

The 3-flow conjecture, factors modulo k, and the 1-2-3-conjecture

The Erdős-Pósa Property for Odd Cycles in Graphs of Large Connectivity

The Jordan-Schonflies Theorem and the Classification of Surface

The Locally Connected Compact Metric Spaces Embeddable In The Plane

article

The Rendezvous Number of a Symmetric Matrix and a Compact Connected Metric Space

The chromatic polynomial and list colorings

The color space of a graph

article by Tommy R. Jensen & Carsten Thomassen published 2000 in Journal of Graph Theory

The flow index and strongly connected orientations

The graph genus problem is NP-complete

article by Carsten Thomassen published December 1989 in Journal of Algorithms

The maximum number of minimal codewords in an [ n , k ] -code

The maximum number of minimal codewords in long codes

The minimum number of minimal codewords in an [ n , k ] -code and in graphic codes

scholarly article by A. Alahmadi et al published March 2015 in Discrete Applied Mathematics

The number of colorings of planar graphs with no separating triangles

The number of k-colorings of a graph on a fixed surface

The square of a planar cubic graph is 7-colorable

The weak 3-flow conjecture and the weak circular flow conjecture

Tight bounds on the chromatic sum of a connected graph

article

Totally Odd $K_4$ -subdivisions in 4-chromatic Graphs

Tutte's spring theorem

article