The following pages link to Carsten Thomassen (Q228790):
Displaying 50 items.
- A simple proof of a theorem of Jung (Q918991) (← links)
- 2-list-coloring planar graphs without monochromatic triangles (Q958693) (← links)
- The chromatic polynomial and list colorings (Q1003851) (← links)
- Decomposing a planar graph of girth 5 into an independent set and a forest (Q1026008) (← links)
- Edge-decompositions of highly connected graphs into paths (Q1032504) (← links)
- Cycles in graphs of uncountable chromatic number (Q1056761) (← links)
- The 2-linkage problem for acyclic digraphs (Q1057282) (← links)
- Subgraphs with large degrees and girth (Q1066158) (← links)
- Sign-nonsingular matrices and even cycles in directed graphs (Q1073811) (← links)
- Interval representations of planar graphs (Q1077425) (← links)
- A sufficient condition for oriented graphs to be Hamiltonian (Q1079579) (← links)
- On Hamilton decompositions of prisms over simple 3-polytopes (Q1079581) (← links)
- Every simple 3-polytype with 34 vertices is Hamiltonian (Q1081618) (← links)
- Even cycles in directed graphs (Q1084409) (← links)
- Characterization of even directed graphs (Q1085177) (← links)
- Counterexamples to Adám's conjecture on arc reversals in directed graphs (Q1086583) (← links)
- On a construction of Thomassen (Q1087884) (← links)
- Path and cycle sub-Ramsey numbers and an edge-colouring conjecture (Q1088687) (← links)
- Hamiltonian dicycles avoiding prescribed arcs in tournaments (Q1090684) (← links)
- On digraphs with no two disjoint directed cycles (Q1092919) (← links)
- A characterization of locally finite vertex-transitive graphs (Q1095158) (← links)
- On the Hamiltonian index (Q1099188) (← links)
- Arc reversals in tournaments (Q1102300) (← links)
- Graphs with one isomorphism class of spanning unicyclic graphs (Q1111570) (← links)
- Whitney's 2-switching theorem, cycle spaces, and arc mappings of directed graphs (Q1117243) (← links)
- When the sign pattern of a square matrix determines uniquely the sign pattern of its inverse (Q1120593) (← links)
- Graphs such that every two edges are contained in a shortest cycle (Q1122590) (← links)
- On Hamiltonian graphs with maximal index (Q1123901) (← links)
- The complexity of planar graph choosability (Q1126188) (← links)
- The cover-index of infinite graphs (Q1137594) (← links)
- Hamiltonian-connected tournaments (Q1140091) (← links)
- On the number of Hamiltonian cycles in tournaments (Q1142228) (← links)
- Planarity and duality of finite and infinite graphs (Q1142781) (← links)
- Non-separating induced cycles in graphs (Q1150377) (← links)
- 2-linked graphs (Q1150633) (← links)
- The size of connected hypergraphs with prescribed covering number (Q1163035) (← links)
- A nine point theorem for 3-connected graphs (Q1165867) (← links)
- Circuits through specified edges (Q1165869) (← links)
- Duality of infinite graphs (Q1172075) (← links)
- Hamiltonism, degree sum and neighborhood intersections (Q1175978) (← links)
- Hamilton decompositions of Cartesian products of graphs (Q1175987) (← links)
- Highly connected non-2-linked digraphs (Q1181017) (← links)
- Pancyclic Hamilton cycles in random graphs (Q1182576) (← links)
- Kings in \(k\)-partite tournaments (Q1185101) (← links)
- On a problem of Hendry (Q1193441) (← links)
- Infinite connected graphs with no end-preserving spanning trees (Q1193567) (← links)
- Dominating cycles in regular 3-connected graphs (Q1193714) (← links)
- Some finiteness results concerning separation in graphs (Q1197018) (← links)
- The chromatic index of a graph whose core has maximum degree two (Q1197023) (← links)
- Hamiltonian cycle is polynomial on cocomparability graphs (Q1201106) (← links)
