What is on his mind? (Q709300): Difference between revisions

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