The following pages link to Carsten Thomassen (Q228790):
Displaying 50 items.
- Group-colouring, group-connectivity, claw-decompositions, and orientations in 5-edge-connected planar graphs (Q286749) (← links)
- The 3-flow conjecture, factors modulo \(k\), and the 1-2-3-conjecture (Q326818) (← links)
- Decomposing graphs into a constant number of locally irregular subgraphs (Q338587) (← links)
- The number of colorings of planar graphs with no separating triangles (Q345111) (← links)
- The maximum number of minimal codewords in an \([n,k]\)-code (Q389190) (← links)
- Graph factors modulo \(k\) (Q402597) (← links)
- The weak 3-flow conjecture and the weak circular flow conjecture (Q412176) (← links)
- From the plane to higher surfaces (Q444375) (← links)
- Nowhere-zero 3-flows and modulo \(k\)-orientations (Q461727) (← links)
- Decomposing a graph into bistars (Q463290) (← links)
- Strongly 2-connected orientations of graphs (Q473099) (← links)
- Addendum: Commentary for ``On planarity of compact, locally connected, metric spaces'' (Q485510) (← links)
- Liftings in finite graphs and linkages in infinite graphs with prescribed edge-connectivity (Q503651) (← links)
- Rainbow paths with prescribed ends (Q540082) (← links)
- Spanning trees and orientation of graphs (Q543985) (← links)
- Switchings, extensions, and reductions in central digraphs (Q549248) (← links)
- (Q591744) (redirect page) (← links)
- Deformations of plane graphs (Q595673) (← links)
- Disjoint cycles in digraphs (Q595675) (← links)
- On the complexity of some colorful problems parameterized by treewidth (Q627124) (← links)
- On planarity of compact, locally connected, metric spaces (Q654007) (← links)
- Infinitely connected subgraphs in graphs of uncountable chromatic number (Q681605) (← links)
- Chords in longest cycles (Q684125) (← links)
- Polychromatic Hamilton cycles (Q685588) (← links)
- Some conditions for 1-transitivity (Q686312) (← links)
- On existence theorems (Q686508) (← links)
- Highly symmetric subgraphs of hypercubes (Q686980) (← links)
- Some remarks on Hajós' conjecture (Q707025) (← links)
- Group flow, complex flow, unit vector flow, and the \((2 + \epsilon)\)-flow conjecture (Q740648) (← links)
- Bidirectional retracting-free double tracings and upper embeddability of graphs (Q751672) (← links)
- Cycles through four edges in 3-connected cubic graphs (Q753835) (← links)
- Kneser's conjecture, chromatic number, and homotopy (Q755592) (← links)
- A minimal condition implying a special K\(_4\)-subdivision in a graph (Q759038) (← links)
- On k-rails in graphs (Q759040) (← links)
- Bounds on path connectivity (Q761468) (← links)
- (Q790823) (redirect page) (← links)
- Crossing-critical edges and Kuratowski subgraphs of a graph (Q790824) (← links)
- Infinite families of crossing-critical graphs with a given crossing number (Q790825) (← links)
- Girth in graphs (Q792338) (← links)
- A refinement of Kuratowski's theorem (Q800369) (← links)
- Minimal graphs with crossing number at least \(k\) (Q810038) (← links)
- Linear transformations of tropical matrices preserving the cyclicity index (Q825561) (← links)
- The number of \(k\)-colorings of a graph on a fixed surface (Q856865) (← links)
- Density conditions for triangles in multipartite graphs (Q858108) (← links)
- Hajós' conjecture for line graphs (Q858687) (← links)
- Many 3-colorings of triangle-free planar graphs (Q875936) (← links)
- Exponentially many 5-list-colorings of planar graphs (Q885292) (← links)
- The converse of the Jordan curve theorem and a characterization of planar maps (Q908549) (← links)
- Embeddings of graphs with no short noncontractible cycles (Q916669) (← links)
- Resistances and currents in infinite electrical networks (Q918944) (← links)
