What is on his mind? - MaRDI portal

DOI10.1016/j.disc.2010.06.007zbMath1208.05003MaRDI QIDQ709300

Publication date: 18 October 2010

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2010.06.007

zbMATH Keywords

Thomassen; questions and conjectures

Mathematics Subject Classification ID

05-02: Research exposition (monographs, survey articles) pertaining to combinatorics

01A70: Biographies, obituaries, personalia, bibliographies

05C38: Paths and cycles

05C10: Planar graphs; geometric and topological aspects of graph theory

05C15: Coloring of graphs and hypergraphs

05C20: Directed graphs (digraphs), tournaments

05C40: Connectivity

05C45: Eulerian and Hamiltonian graphs

Cites Work

Claw‐decompositions and tutte‐orientations
Two‐connected orientations of Eulerian graphs
Digraphs
Infinite graphs—A survey
Polytopes, graphs, and complexes
A 4-Color Theorem for Toroidal Graphs
Hamilton connectivity of line graphs and claw‐free graphs
On Graphs Having No Chromatic Zeros in (1,2)
A Theorem on Graphs, with an Application to a Problem of Traffic Control
On Hamiltonian Circuits
Acyclic 5-choosability of planar graphs without 4-cycles
A theorem on paths in planar graphs
The Erdős-Pósa property for odd cycles in graphs of large connectivity
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Disjoint cycles in digraphs
Non-separating even cycles in highly connected graphs
List colourings of planar graphs
Partition of graphs with condition on the connectivity and minimum degree
On hamiltonian line graphs and connectivity
Chords of longest circuits in locally planar graphs
Many 3-colorings of triangle-free planar graphs
2-connected spanning subgraphs with low maximum degree in locally planar graphs
Chromatic properties of Hamiltonian graphs
Exponentially many 5-list-colorings of planar graphs
A weaker version of Lovász' path removal conjecture
Graphs with full rank 3-color matrix and few 3-colorings
Two proofs of the Bermond-Thomassen conjecture for tournaments with bounded minimum in-degree
Contractible subgraphs, Thomassen's conjecture and the dominating cycle conjecture for snarks
Graphs with chromatic roots in the interval \((1,2)\)
Degree constrained orientations in countable graphs
Edge-decompositions of highly connected graphs into paths
Hamilton paths and cycles in vertex-transitive graphs of order \(6p\)
Hamilton cycles and paths in vertex-transitive graphs-current directions
Acyclic 5-choosability of planar graphs with neither 4-cycles nor chordal 6-cycles
Sign-nonsingular matrices and even cycles in directed graphs
Graph minors. V. Excluding a planar graph
Even cycles in directed graphs
Cycles in k-connected graphs whose deletion results in a (k-2)-connected graph
Disjoint directed cycles
The complexity of planar graph choosability
A solution to a colouring problem of P. Erdős
Spanning cycles of nearly cubic graphs
On acyclic colorings of planar graphs
Highly connected sets and the excluded grid theorem
\(3n-5\) edges do force a subdivision of \(K_5\)
Trees in triangulations
Coloring graphs without short non-bounding cycles
4-connected projective planar graphs are Hamiltonian
Every planar graph is 5-choosable
Spanning trees in locally planar triangulations
2-walks in circuit graphs
Grötzsch's 3-color theorem and its counterparts for the torus and the projective plane
Every 4-connected line graph of a planar graph is Hamiltonian
A survey on contractible edges in graphs of a prescribed vertex connectivity
Five-connected toroidal graphs are Hamiltonian
On a closure concept in claw-free graphs
Chords of longest cycles in cubic graphs
The chromatic number of a graph of girth 5 on a fixed surface
A short list color proof of Grötzsch's theorem
Contractible cycles in graphs with girth at least 5
Non-separating paths in 4-connected graphs
All 4-connected line graphs of claw free graphs are Hamiltonian connected
Combinatorial optimization. Polyhedra and efficiency (3 volumes)
Graph connectivity after path removal
Three-coloring Klein bottle graphs of girth five
A theorem on paths in locally planar triangulations
Nonhamiltonian triangulations with large connectivity and representativity
Every 3-connected, essentially 11-connected line graph is Hamiltonian
Existenz n-fach zusammenhängender Teilgraphen in Graphen genügend großer Kantendichte
Graphs with \(3n-6\) edges not containing a subdivision of \(K_5\)
On the existence of \(k\) edge-disjoint 2-connected spanning subgraphs
Homomorphism theorems for graphs
Chromatic numbers of quadrangulations on closed surfaces
On the Number of Hamiltonian Cycles in Bipartite Graphs
Disjoint paths, planarizing cycles, and spanning walks
Some Homeomorphism Properties of Graphs
A Theorem on Planar Graphs
On the Problem of Decomposing a Graph into n Connected Factors
On Orientations, Connectivity and Odd-Vertex-Pairings in Finite Graphs
Edge-Disjoint Spanning Trees of Finite Graphs
Hamiltonian results inK1,3-free graphs
Acyclic 5-choosability of planar graphs without small cycles
A Step toward the Bermond–Thomassen Conjecture about Disjoint Cycles in Digraphs
Coloring of Triangle-Free Graphs on the Double Torus
Decompositions of highly connected graphs into paths of length 3
Infinite, highly connected digraphs with no two arc-disjoint spanning trees
On partitioning the edges of graphs into connected subgraphs
My Graph
Nonseparating cycles inK-Connected graphs
Do 3n − 5 edges force a subdivision ofK5?
The Even Cycle Problem for Directed Graphs
Hamiltonian Cycles and Uniquely Edge Colourable Graphs
A Zero-Free Interval for Chromatic Polynomials of Graphs
Uniqueness of maximal dominating cycles in 3‐regular graphs and of hamiltonian cycles in 4‐regular graphs
Coloring graphs with fixed genus and girth
The Zero-Free Intervals for Chromatic Polynomials of Graphs
Acyclic list 7‐coloring of planar graphs
On the acyclic choosability of graphs