What is on his mind? (Q709300)

From MaRDI portal

Jump to:navigation, search

scientific article

Language	Label	Description	Also known as
English	What is on his mind?	scientific article

Statements

scholarly article

0 references

What is on his mind? (English)

0 references

zbMATH Open document ID

0 references

10.1016/j.disc.2010.06.007

0 references

0 references

Matthias Kriesell

0 references

Discrete Mathematics

0 references

publication date

18 October 2010

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

0 references

0 references

0 references

0 references

0 references

zbMATH DE Number

0 references

zbMATH Keywords

questions and conjectures

0 references

Thomassen

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1016/j.disc.2010.06.007

0 references

0 references

Infinite, highly connected digraphs with no two arc-disjoint spanning trees

0 references

Disjoint directed cycles

0 references

Nonhamiltonian triangulations with large connectivity and representativity

0 references

Chromatic numbers of quadrangulations on closed surfaces

0 references

0 references

0 references

Claw‐decompositions and tutte‐orientations

0 references

Two‐connected orientations of Eulerian graphs

0 references

Degree constrained orientations in countable graphs

0 references

Two proofs of the Bermond-Thomassen conjecture for tournaments with bounded minimum in-degree

0 references

Chromatic properties of Hamiltonian graphs

0 references

0 references

On acyclic colorings of planar graphs

0 references

Acyclic list 7‐coloring of planar graphs

0 references

Contractible subgraphs, Thomassen's conjecture and the dominating cycle conjecture for snarks

0 references

Graph connectivity after path removal

0 references

Acyclic 5-choosability of planar graphs without 4-cycles

0 references

0 references

0 references

Highly connected sets and the excluded grid theorem

0 references

Homomorphism theorems for graphs

0 references

On Graphs Having No Chromatic Zeros in (1,2)

0 references

Cycles in k-connected graphs whose deletion results in a (k-2)-connected graph

0 references

Contractible cycles in graphs with girth at least 5

0 references

Spanning trees in locally planar triangulations

0 references

2-connected spanning subgraphs with low maximum degree in locally planar graphs

0 references

Spanning cycles of nearly cubic graphs

0 references

Coloring graphs without short non-bounding cycles

0 references

Uniqueness of maximal dominating cycles in 3‐regular graphs and of hamiltonian cycles in 4‐regular graphs

0 references

A solution to a colouring problem of P. Erdős

0 references

0 references

0 references

Non-separating even cycles in highly connected graphs

0 references

2-walks in circuit graphs

0 references

Coloring graphs with fixed genus and girth

0 references

Polytopes, graphs, and complexes

0 references

The complexity of planar graph choosability

0 references

0 references

Partition of graphs with condition on the connectivity and minimum degree

0 references

Hamilton connectivity of line graphs and claw‐free graphs

0 references

A Zero-Free Interval for Chromatic Polynomials of Graphs

0 references

0 references

0 references

0 references

On the existence of \(k\) edge-disjoint 2-connected spanning subgraphs

0 references

On partitioning the edges of graphs into connected subgraphs

0 references

A theorem on paths in locally planar triangulations

0 references

A weaker version of Lovász' path removal conjecture

0 references

Non-separating paths in 4-connected graphs

0 references

Chords of longest circuits in locally planar graphs

0 references

Do 3n − 5 edges force a subdivision ofK5?

0 references

Coloring of Triangle-Free Graphs on the Double Torus

0 references

A survey on contractible edges in graphs of a prescribed vertex connectivity

0 references

0 references

All 4-connected line graphs of claw free graphs are Hamiltonian connected

0 references

A 4-Color Theorem for Toroidal Graphs

0 references

Hamilton paths and cycles in vertex-transitive graphs of order \(6p\)

0 references

Hamilton cycles and paths in vertex-transitive graphs-current directions

0 references

Every 4-connected line graph of a planar graph is Hamiltonian

0 references

Every 3-connected, essentially 11-connected line graph is Hamiltonian

0 references

A Step toward the Bermond–Thomassen Conjecture about Disjoint Cycles in Digraphs

0 references

\(3n-5\) edges do force a subdivision of \(K_5\)

0 references

0 references

Graphs with \(3n-6\) edges not containing a subdivision of \(K_5\)

0 references

Existenz n-fach zusammenhängender Teilgraphen in Graphen genügend großer Kantendichte

0 references

0 references

Hamiltonian results inK1,3-free graphs

0 references

0 references

On the acyclic choosability of graphs

0 references

Acyclic 5-choosability of planar graphs without small cycles

0 references

On Orientations, Connectivity and Odd-Vertex-Pairings in Finite Graphs

0 references

Infinite graphs—A survey

0 references

Edge-Disjoint Spanning Trees of Finite Graphs

0 references

0 references

Graphs with full rank 3-color matrix and few 3-colorings

0 references

A Theorem on Graphs, with an Application to a Problem of Traffic Control

0 references

Graph minors. V. Excluding a planar graph

0 references

Graphs with chromatic roots in the interval \((1,2)\)

0 references

On a closure concept in claw-free graphs

0 references

Combinatorial optimization. Polyhedra and efficiency (3 volumes)

0 references

0 references

0 references

Hamiltonian Cycles and Uniquely Edge Colourable Graphs

0 references

0 references

Disjoint cycles in digraphs

0 references

Some Homeomorphism Properties of Graphs

0 references

Nonseparating cycles inK-Connected graphs

0 references

The Erdős-Pósa property for odd cycles in graphs of large connectivity

0 references

Trees in triangulations

0 references

Chords of longest cycles in cubic graphs

0 references

Sign-nonsingular matrices and even cycles in directed graphs

0 references

The Even Cycle Problem for Directed Graphs

0 references

Even cycles in directed graphs

0 references

Grötzsch's 3-color theorem and its counterparts for the torus and the projective plane

0 references

The chromatic number of a graph of girth 5 on a fixed surface

0 references

A theorem on paths in planar graphs

0 references

On the Number of Hamiltonian Cycles in Bipartite Graphs

0 references

The Zero-Free Intervals for Chromatic Polynomials of Graphs

0 references

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

0 references

Every planar graph is 5-choosable

0 references

Edge-decompositions of highly connected graphs into paths

0 references

Decompositions of highly connected graphs into paths of length 3

0 references

Many 3-colorings of triangle-free planar graphs

0 references

Exponentially many 5-list-colorings of planar graphs

0 references

Three-coloring Klein bottle graphs of girth five

0 references

4-connected projective planar graphs are Hamiltonian

0 references

Five-connected toroidal graphs are Hamiltonian

0 references

A Theorem on Planar Graphs

0 references

On the Problem of Decomposing a Graph into <i>n</i> Connected Factors

0 references

On Hamiltonian Circuits

0 references

List colourings of planar graphs

0 references

0 references

Disjoint paths, planarizing cycles, and spanning walks

0 references

On hamiltonian line graphs and connectivity

0 references

Acyclic 5-choosability of planar graphs with neither 4-cycles nor chordal 6-cycles

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:709300

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q709300&oldid=35194324"