What is on his mind?
type: Item
instance of: scholarly article
title: What is on his mind?
zbMATH Open document ID: 1208.05003
author: János Barát
author: Matthias Kriesell
published in: Discrete Mathematics
publication date: 2010-10-18T00:00:00Z
Mathematics Subject Classification ID: 05-02
Mathematics Subject Classification ID: 01A70
Mathematics Subject Classification ID: 05C10
Mathematics Subject Classification ID: 05C15
Mathematics Subject Classification ID: 05C20
Mathematics Subject Classification ID: 05C38
Mathematics Subject Classification ID: 05C40
Mathematics Subject Classification ID: 05C45
zbMATH DE Number: 5801200
zbMATH Keywords: questions and conjectures
zbMATH Keywords: Thomassen
MaRDI profile type: Publication
full work available at URL: j.disc.2010.06.007
OpenAlex ID: W2055267977
cites work: Infinite, highly connected digraphs with no two arc-disjoint spanning trees
cites work: Disjoint directed cycles
cites work: Nonhamiltonian triangulations with large connectivity and representativity
cites work: Chromatic numbers of quadrangulations on closed surfaces
cites work: Q4871775
cites work: Digraphs
cites work: Claw‐decompositions and tutte‐orientations
cites work: Two‐connected orientations of Eulerian graphs
cites work: Degree constrained orientations in countable graphs
cites work: Two proofs of the Bermond-Thomassen conjecture for tournaments with bounded minimum in-degree
cites work: Chromatic properties of Hamiltonian graphs
cites work: Q5422499
cites work: On acyclic colorings of planar graphs
cites work: Acyclic list 7‐coloring of planar graphs
cites work: Contractible subgraphs, Thomassen's conjecture and the dominating cycle conjecture for snarks
cites work: Graph connectivity after path removal
cites work: Acyclic 5-choosability of planar graphs without 4-cycles
cites work: My Graph
cites work: Q5315023
cites work: Highly connected sets and the excluded grid theorem
cites work: Homomorphism theorems for graphs
cites work: On Graphs Having No Chromatic Zeros in (1,2)
cites work: Cycles in k-connected graphs whose deletion results in a (k-2)-connected graph
cites work: Contractible cycles in graphs with girth at least 5
cites work: Spanning trees in locally planar triangulations
cites work: 2-connected spanning subgraphs with low maximum degree in locally planar graphs
cites work: Spanning cycles of nearly cubic graphs
cites work: Coloring graphs without short non-bounding cycles
cites work: Uniqueness of maximal dominating cycles in 3‐regular graphs and of hamiltonian cycles in 4‐regular graphs
cites work: A solution to a colouring problem of P. Erdős
cites work: Q4871749
cites work: Q4170745
cites work: Non-separating even cycles in highly connected graphs
cites work: 2-walks in circuit graphs
cites work: Coloring graphs with fixed genus and girth
cites work: Polytopes, graphs, and complexes
cites work: The complexity of planar graph choosability
cites work: Q5653952
cites work: Partition of graphs with condition on the connectivity and minimum degree
cites work: Hamilton connectivity of line graphs and claw‐free graphs
cites work: A Zero-Free Interval for Chromatic Polynomials of Graphs
cites work: Q3807237
cites work: The color space of a graph
cites work: Q4857375
cites work: On the existence of \(k\) edge-disjoint 2-connected spanning subgraphs
cites work: On partitioning the edges of graphs into connected subgraphs
cites work: A theorem on paths in locally planar triangulations
cites work: A weaker version of Lovász' path removal conjecture
cites work: Non-separating paths in 4-connected graphs
cites work: Chords of longest circuits in locally planar graphs
cites work: Do 3n − 5 edges force a subdivision ofK5?
cites work: Coloring of Triangle-Free Graphs on the Double Torus
cites work: A survey on contractible edges in graphs of a prescribed vertex connectivity
cites work: Induced paths in 5-connected graphs
cites work: All 4-connected line graphs of claw free graphs are Hamiltonian connected
cites work: A 4-Color Theorem for Toroidal Graphs
cites work: Hamilton paths and cycles in vertex-transitive graphs of order \(6p\)
cites work: Hamilton cycles and paths in vertex-transitive graphs-current directions

What is on his mind? (cites work)
cites work: Every 4-connected line graph of a planar graph is Hamiltonian

What is on his mind? (cites work)
cites work: Every 3-connected, essentially 11-connected line graph is Hamiltonian

What is on his mind? (cites work)
cites work: A Step toward the Bermond–Thomassen Conjecture about Disjoint Cycles in Digraphs

What is on his mind? (cites work)
cites work: \(3n-5\) edges do force a subdivision of \(K_5\)

What is on his mind? (cites work)
cites work: An extremal problem for subdivisions ofK?5

What is on his mind? (cites work)
cites work: Graphs with \(3n-6\) edges not containing a subdivision of \(K_5\)

What is on his mind? (cites work)
cites work: Existenz n-fach zusammenhängender Teilgraphen in Graphen genügend großer Kantendichte

What is on his mind? (cites work)
cites work: Q4189309

What is on his mind? (cites work)
cites work: Hamiltonian results inK1,3-free graphs

What is on his mind? (cites work)
cites work: Graphs on surfaces

What is on his mind? (cites work)
cites work: On the acyclic choosability of graphs

What is on his mind? (cites work)
cites work: Acyclic 5-choosability of planar graphs without small cycles

What is on his mind? (cites work)
cites work: On Orientations, Connectivity and Odd-Vertex-Pairings in Finite Graphs

What is on his mind? (cites work)
cites work: Infinite graphs—A survey

What is on his mind? (cites work)
cites work: Edge-Disjoint Spanning Trees of Finite Graphs

What is on his mind? (cites work)
cites work: Q5678882

What is on his mind? (cites work)
cites work: Graphs with full rank 3-color matrix and few 3-colorings

What is on his mind? (cites work)
cites work: A Theorem on Graphs, with an Application to a Problem of Traffic Control

What is on his mind? (cites work)
cites work: Graph minors. V. Excluding a planar graph

What is on his mind? (cites work)
cites work: Graphs with chromatic roots in the interval \((1,2)\)

What is on his mind? (cites work)
cites work: On a closure concept in claw-free graphs

What is on his mind? (cites work)
cites work: Combinatorial optimization. Polyhedra and efficiency (3 volumes)

What is on his mind? (cites work)
cites work: Q4294626

What is on his mind? (cites work)
cites work: Q4715286

What is on his mind? (cites work)
cites work: Hamiltonian Cycles and Uniquely Edge Colourable Graphs

What is on his mind? (cites work)
cites work: Q3491608

What is on his mind? (cites work)
cites work: Disjoint cycles in digraphs

What is on his mind? (cites work)
cites work: Some Homeomorphism Properties of Graphs

What is on his mind? (cites work)
cites work: Nonseparating cycles inK-Connected graphs

What is on his mind? (cites work)
cites work: The Erdős-Pósa property for odd cycles in graphs of large connectivity

What is on his mind? (cites work)
cites work: Trees in triangulations

What is on his mind? (cites work)
cites work: Chords of longest cycles in cubic graphs

What is on his mind? (cites work)
cites work: Sign-nonsingular matrices and even cycles in directed graphs

What is on his mind? (cites work)
cites work: The Even Cycle Problem for Directed Graphs

What is on his mind? (cites work)
cites work: Even cycles in directed graphs

What is on his mind? (cites work)
cites work: Grötzsch's 3-color theorem and its counterparts for the torus and the projective plane

What is on his mind? (cites work)
cites work: The chromatic number of a graph of girth 5 on a fixed surface

What is on his mind? (cites work)
cites work: A theorem on paths in planar graphs

What is on his mind? (cites work)
cites work: On the number of Hamiltonian cycles in bipartite graphs

What is on his mind? (cites work)
cites work: The Zero-Free Intervals for Chromatic Polynomials of Graphs

What is on his mind? (cites work)
cites work: A short list color proof of Grötzsch's theorem

What is on his mind? (cites work)
cites work: Every planar graph is 5-choosable

What is on his mind? (cites work)
cites work: Edge-decompositions of highly connected graphs into paths

What is on his mind? (cites work)
cites work: Decompositions of highly connected graphs into paths of length 3

What is on his mind? (cites work)
cites work: Many 3-colorings of triangle-free planar graphs

What is on his mind? (cites work)
cites work: Exponentially many 5-list-colorings of planar graphs

What is on his mind? (cites work)
cites work: Three-coloring Klein bottle graphs of girth five

What is on his mind? (cites work)
cites work: 4-connected projective planar graphs are Hamiltonian

What is on his mind? (cites work)
cites work: Five-connected toroidal graphs are Hamiltonian

What is on his mind? (cites work)
cites work: A Theorem on Planar Graphs

What is on his mind? (cites work)
cites work: On the Problem of Decomposing a Graph into n Connected Factors

What is on his mind? (cites work)
cites work: On Hamiltonian Circuits

What is on his mind? (cites work)
cites work: List colourings of planar graphs

What is on his mind? (cites work)
cites work: 4-chromatic projective graphs

What is on his mind? (cites work)
cites work: Disjoint paths, planarizing cycles, and spanning walks

What is on his mind? (cites work)
cites work: On hamiltonian line graphs and connectivity

What is on his mind? (cites work)
cites work: Acyclic 5-choosability of planar graphs with neither 4-cycles nor chordal 6-cycles

What is on his mind? (DOI)
DOI: 10.1016/J.DISC.2010.06.007