Carsten Thomassen

Eur. J. Comb., 2024

Ádám's conjecture.

[BibT_eX]

[DOI]

J. Comb. Theory B, July, 2023

Exponentially many 3-colorings of planar triangle-free graphs with no short separating cycles.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2023

Exponentially many Z5-colorings in simple planar graphs.

[BibT_eX]

[DOI]

Rikke Langhede

,

Discret. Math., 2021

Cycles containing all the odd-degree vertices.

[BibT_eX]

[DOI]

Kathie Cameron

,

J. Comb. Theory B, 2020

Factorizing regular graphs.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2020

Cycles in 5-connected triangulations.

[BibT_eX]

[DOI]

Adel Alahmadi

,

,

J. Comb. Theory, Ser. B, 2020

Group Connectivity and Group Coloring: Small Groups versus Large Groups.

[BibT_eX]

[DOI]

Rikke Langhede

,

Electron. J. Comb., 2020

Locally Hamiltonian Graphs and Minimal Size of Maximal Graphs on a Surface.

[BibT_eX]

[DOI]

James Davies

,

Electron. J. Comb., 2020

Fractional Coloring Methods with Applications to Degenerate Graphs and Graphs on Surfaces.

[BibT_eX]

[DOI]

,

,

,

SIAM J. Discret. Math., 2019

Hamilton cycles in sparse locally connected graphs.

[BibT_eX]

[DOI]

,

,

,

,

Discret. Appl. Math., 2019

Partite Turán-densities for complete r-uniform hypergraphs on r+1 vertices.

[BibT_eX]

[DOI]

Klas Markström

,

CoRR, 2019

Planar Ramsey Graphs.

[BibT_eX]

[DOI]

,

,

,

Electron. J. Comb., 2019

Deciding Parity of Graph Crossing Number.

[BibT_eX]

[DOI]

Petr Hlinený

,

SIAM J. Discret. Math., 2018

Chords in longest cycles.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2018

The square of a planar cubic graph is 7-colorable.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2018

The flow index and strongly connected orientations.

[BibT_eX]

[DOI]

,

,

,

Eur. J. Comb., 2018

Density of Chromatic Roots in Minor-Closed Graph Families.

[BibT_eX]

[DOI]

Thomas J. Perrett

,

Comb. Probab. Comput., 2018

On the Minimum Number of Spanning Trees in k-Edge-Connected Graphs.

[BibT_eX]

[DOI]

Seongmin Ok

,

J. Graph Theory, 2017

The number of colorings of planar graphs with no separating triangles.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2017

Cycles through all finite vertex sets in infinite graphs.

[BibT_eX]

[DOI]

André Kündgen

,

Binlong Li

,

Eur. J. Comb., 2017

Decomposing graphs into a constant number of locally irregular subgraphs.

[BibT_eX]

[DOI]

Julien Bensmail

,

Martin Merker

,

Eur. J. Comb., 2017

Nash-Williams' cycle-decomposition theorem.

[BibT_eX]

[DOI]

Comb., 2017

Infinitely connected subgraphs in graphs of uncountable chromatic number.

[BibT_eX]

[DOI]

Comb., 2017

The 3-flow conjecture, factors modulo k, and the 1-2-3-conjecture.

[BibT_eX]

[DOI]

,

Yezhou Wu

,

Cun-Quan Zhang

J. Comb. Theory B, 2016

Liftings in Finite Graphs and Linkages in Infinite Graphs with Prescribed Edge-Connectivity.

[BibT_eX]

[DOI]

Seongmin Ok

,

,

Graphs Comb., 2016

Orientations of infinite graphs with prescribed edge-connectivity.

[BibT_eX]

[DOI]

Comb., 2016

Strongly 2-connected orientations of graphs.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2015

Extending a perfect matching to a Hamiltonian cycle.

[BibT_eX]

[DOI]

,

,

,

,

,

Discret. Math. Theor. Comput. Sci., 2015

The minimum number of minimal codewords in an [n, k]-code and in graphic codes.

[BibT_eX]

[DOI]

,

,

,

,

,

Discret. Appl. Math., 2015

Destroying longest cycles in graphs and digraphs.

[BibT_eX]

[DOI]

,

,

,

,

,

,

Discret. Appl. Math., 2015

Group flow, complex flow, unit vector flow, and the (2+ε)-flow conjecture.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2014

Graph factors modulo k.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2014

Erratum to: Commentary for "On planarity of compact, locally connected, metric spaces".

[BibT_eX]

[DOI]

,

Brendan Rooney

,

Comb., 2014

Decomposing a graph into bistars.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2013

Nowhere-zero 3-flows and modulo k-orientations.

[BibT_eX]

[DOI]

,

,

,

J. Comb. Theory B, 2013

The maximum number of minimal codewords in an [n, k][n, k]-code.

[BibT_eX]

[DOI]

,

,

,

,

Discret. Math., 2013

The maximum number of minimal codewords in long codes.

[BibT_eX]

[DOI]

,

,

,

,

Discret. Appl. Math., 2013

Decomposing graphs into paths of fixed length.

[BibT_eX]

[DOI]

Comb., 2013

The weak 3-flow conjecture and the weak circular flow conjecture.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2012

From the plane to higher surfaces.

[BibT_eX]

[DOI]

Ken-ichi Kawarabayashi

,

J. Comb. Theory B, 2012

The maximum number of minimal codewords in an $[n,k]-$code

[BibT_eX]

[DOI]

,

,

,

,

CoRR, 2012

On the Number of Longest and Almost Longest Cycles in Cubic Graphs.

[BibT_eX]

Gek Ling Chia

,

Ars Comb., 2012

Switchings, extensions, and reductions in central digraphs.

[BibT_eX]

[DOI]

André Kündgen

,

Gregor Leander

,

J. Comb. Theory A, 2011

On the complexity of some colorful problems parameterized by treewidth.

[BibT_eX]

[DOI]

,

,

,

,

,

,

Inf. Comput., 2011

Rainbow Paths with Prescribed Ends.

[BibT_eX]

[DOI]

Meysam Alishahi

,

Ali Taherkhani

,

Electron. J. Comb., 2011

On planarity of compact, locally connected, metric spaces.

[BibT_eX]

[DOI]

,

Brendan Rooney

,

Comb., 2011

Grinberg's Criterion Applied to Some Non-Planar Graphs.

[BibT_eX]

Gek Ling Chia

,

Ars Comb., 2011

The chromatic polynomial and list colorings.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2009

Decomposing a planar graph of girth 5 into an independent set and a forest.

[BibT_eX]

[DOI]

Ken-ichi Kawarabayashi

,

J. Comb. Theory B, 2009

Decompositions of highly connected graphs into paths of length 3.

[BibT_eX]

[DOI]

J. Graph Theory, 2008

On the maximum number of cycles in a planar graph.

[BibT_eX]

[DOI]

,

J. Graph Theory, 2008

2-List-coloring planar graphs without monochromatic triangles.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2008

Graph-like continua, augmenting arcs, and Menger's theorem.

[BibT_eX]

[DOI]

,

Antoine Vella

Comb., 2008

Exponentially many 5-list-colorings of planar graphs.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2007

Many 3-colorings of triangle-free planar graphs.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2007

Hajós' conjecture for line graphs.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2007

On The Chromatic Number Of Pentagon-Free Graphs Of Large Minimum Degree.

[BibT_eX]

[DOI]

Comb., 2007

A Cantor-Bernstein Theorem for Paths in Graphs.

[BibT_eX]

[DOI]

Reinhard Diestel

,

Am. Math. Mon., 2006

On the max-cut problem for a planar, cubic, triangle-free graph, and the Chinese postman problem for a planar triangulation.

[BibT_eX]

[DOI]

J. Graph Theory, 2006

Rectangular and visibility representations of infinite planar graphs.

[BibT_eX]

[DOI]

J. Graph Theory, 2006

Edge-disjoint Hamiltonian cycles in hypertournaments.

[BibT_eX]

[DOI]

Vojislav Petrovic

,

J. Graph Theory, 2006

Claw-decompositions and tutte-orientations.

[BibT_eX]

[DOI]

János Barát

,

J. Graph Theory, 2006

The number of k-colorings of a graph on a fixed surface.

[BibT_eX]

[DOI]

Discret. Math., 2006

Density Conditions For Triangles In Multipartite Graphs.

[BibT_eX]

[DOI]

,

,

,

Comb., 2006

Some remarks on Hajo's' conjecture.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2005

Tutte's spring theorem.

[BibT_eX]

[DOI]

J. Graph Theory, 2004

Graphs with not all possible path-kernels.

[BibT_eX]

[DOI]

,

Discret. Math., 2004

Classification Of Locally 2-Connected Compact Metric Spaces.

[BibT_eX]

[DOI]

Comb., 2004

The Locally Connected Compact Metric Spaces Embeddable In The Plane.

[BibT_eX]

[DOI]

Comb., 2004

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

[BibT_eX]

[DOI]

J. Comb. Theory B, 2003

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

[BibT_eX]

[DOI]

J. Comb. Theory B, 2003

Long Cycles in Graphs on a Fixed Surface.

[BibT_eX]

[DOI]

Thomas Böhme

,

Bojan Mohar

,

J. Comb. Theory B, 2002

An intersection graph of straight lines.

[BibT_eX]

[DOI]

Discret. Math., 2002

On the Chromatic Number of Triangle-Free Graphs of Large Minimum Degree.

[BibT_eX]

[DOI]

Comb., 2002

Decomposing a Planar Graph into an Independent Set and a 3-Degenerate Graph.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2001

Totally Odd K4-subdivisions in 4-chromatic Graphs.

[BibT_eX]

[DOI]

Comb., 2001

The Erdos-Pósa Property for Odd Cycles in Graphs of Large Connectivity.

[BibT_eX]

[DOI]

Comb., 2001

The Rendezvous Number of a Symmetric Matrix and a Compact Connected Metric Space.

[BibT_eX]

[DOI]

Am. Math. Mon., 2000

The color space of a graph.

[BibT_eX]

[DOI]

Tommy R. Jensen

,

J. Graph Theory, 2000

Chromatic Roots and Hamiltonian Paths.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2000

Coloring triangle-free graphs with fixed size.

[BibT_eX]

[DOI]

John Gimbel

,

Discret. Math., 2000

Two-Coloring the Edges of a Cubic Graph Such That Each Monochromatic Component Is a Path of Length at Most 5.

[BibT_eX]

[DOI]

J. Comb. Theory B, 1999

Highly Connected Sets and the Excluded Grid Theorem.

[BibT_eX]

[DOI]

Reinhard Diestel

,

Tommy R. Jensen

,

Konstantin Yu. Gorbunov

,

J. Comb. Theory B, 1999

Independent Dominating Sets and a Second Hamiltonian Cycle in Regular Graphs.

[BibT_eX]

[DOI]

J. Comb. Theory B, 1998

On the Complexity of Finding a Minimum Cycle Cover of a Graph.

[BibT_eX]

[DOI]

SIAM J. Comput., 1997

The Genus Problem for Cubic Graphs.

[BibT_eX]

[DOI]

J. Comb. Theory B, 1997

A Simpler Proof of the Excluded Minor Theorem for Higher Surfaces.

[BibT_eX]

[DOI]

J. Comb. Theory B, 1997

Color-Critical Graphs on a Fixed Surface.

[BibT_eX]

[DOI]

J. Comb. Theory B, 1997

Chords of Longest Cycles in Cubic Graphs.

[BibT_eX]

[DOI]

J. Comb. Theory B, 1997

On the Number of Cycles in 3-Connected Cubic Graphs.

[BibT_eX]

[DOI]

,

J. Comb. Theory B, 1997

Dirac's conjecture on K5-subdivisions.

[BibT_eX]

[DOI]

Discret. Math., 1997

The Zero-Free Intervals for Chromatic Polynomials of Graphs.

[BibT_eX]

[DOI]

Comb. Probab. Comput., 1997

Directed Cycles with Two Chords and Strong Spanning Directed Subgraphs with Few Arcs.

[BibT_eX]

[DOI]

J. Comb. Theory B, 1996

On the Number of Hamiltonian Cycles in Bipartite Graphs.

[BibT_eX]

[DOI]

Comb. Probab. Comput., 1996

K5-Subdivisions in Graphs.

[BibT_eX]

[DOI]

Comb. Probab. Comput., 1996

3-List-Coloring Planar Graphs of Girth 5.

[BibT_eX]

[DOI]

J. Comb. Theory B, 1995

Decomposing a Planar Graph into Degenerate Graphs.

[BibT_eX]

[DOI]

J. Comb. Theory B, 1995

Intersections of Curve Systems and the Crossing Number of C5 X C5.

[BibT_eX]

[DOI]

,

Discret. Comput. Geom., 1995

Editorial.

[BibT_eX]

[DOI]

,

Edward R. Scheinerman

J. Graph Theory, 1994

Trees in Triangulations.

[BibT_eX]

[DOI]

J. Comb. Theory B, 1994

Grötzsch's 3-Color Theorem and Its Counterparts for the Torus and the Projective Plane.

[BibT_eX]

[DOI]

J. Comb. Theory B, 1994

Every Planar Graph Is 5-Choosable.

[BibT_eX]

[DOI]

J. Comb. Theory B, 1994

Five-Coloring Graphs on the Torus.

[BibT_eX]

[DOI]

J. Comb. Theory B, 1994

Embeddings of graphs.

[BibT_eX]

[DOI]

Discret. Math., 1994

Vertex-Transitive Graphs and Accessibility.

[BibT_eX]

[DOI]

,

Wolfgang Woess

J. Comb. Theory B, 1993

Triangulating a Surface with a Prescribed Graph.

[BibT_eX]

[DOI]

J. Comb. Theory B, 1993

Five-Coloring Maps on Surfaces.

[BibT_eX]

[DOI]

J. Comb. Theory B, 1993

Minimal Graphs with Crossing Number at Least k.

[BibT_eX]

[DOI]

,

J. Comb. Theory B, 1993

The Even Cycle Problem for Planar Digraphs.

[BibT_eX]

[DOI]

J. Algorithms, 1993

A Polynomial Algorithm for the 2-Path Problem for Semicomplete Digraphs.

[BibT_eX]

[DOI]

Jørgen Bang-Jensen

,

SIAM J. Discret. Math., 1992

Infinite connected graphs with no end-preserving spanning trees.

[BibT_eX]

[DOI]

J. Comb. Theory B, 1992

A Polynomial Algorithm for Hamiltonian-Connectedness in Semicomplete Digraphs.

[BibT_eX]

[DOI]

Jørgen Bang-Jensen

,

Yannis Manoussakis

,

J. Algorithms, 1992

Plane Cubic Graphs with Prescribed Face Areas.

[BibT_eX]

[DOI]

Comb. Probab. Comput., 1992

The Hadwiger number of subgroups vertex-transitive graphs.

[BibT_eX]

[DOI]

Comb., 1992

Kings in k-partite tournaments.

[BibT_eX]

[DOI]

Vojislav Petrovic

,

Discret. Math., 1991

Highly connected non-2-linked digraphs.

[BibT_eX]

[DOI]

Comb., 1991

Graphs with homeomorphically irreducible spanning trees.

[BibT_eX]

[DOI]

,

,

,

J. Graph Theory, 1990

Embeddings of graphs with no short noncontractible cycles.

[BibT_eX]

[DOI]

J. Comb. Theory B, 1990

Resistances and currents in infinite electrical networks.

[BibT_eX]

[DOI]

J. Comb. Theory B, 1990

Bidirectional retracting-free double tracings and upper embeddability of graphs.

[BibT_eX]

[DOI]

J. Comb. Theory B, 1990

Tight bounds on the chromatic sum of a connected graph.

[BibT_eX]

[DOI]

,

,

,

,

J. Graph Theory, 1989

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

[BibT_eX]

[DOI]

Ron Aharoni

,

J. Graph Theory, 1989

Whitney's 2-switching theorem, cycle spaces, and arc mappings of directed graphs.

[BibT_eX]

[DOI]

J. Comb. Theory B, 1989

The Graph Genus Problem is NP-Complete.

[BibT_eX]

[DOI]

J. Algorithms, 1989

Rectilinear drawings of graphs.

[BibT_eX]

[DOI]

J. Graph Theory, 1988

On the presence of disjoint subgraphs of a specified type.

[BibT_eX]

[DOI]

J. Graph Theory, 1988

Arc reversals in tournaments.

[BibT_eX]

[DOI]

Discret. Math., 1988

Subgraphs of large connectivity and chromatic number in graphs of large chromatic number.

[BibT_eX]

[DOI]

,

,

,

,

J. Graph Theory, 1987

Counterexamples to Adám's conjecture on arc reversals in directed graphs.

[BibT_eX]

[DOI]

J. Comb. Theory B, 1987

A characterization of locally finite vertex-transitive graphs.

[BibT_eX]

[DOI]

J. Comb. Theory B, 1987

Characterization of even directed graphs.

[BibT_eX]

[DOI]

Paul D. Seymour

,

J. Comb. Theory B, 1987

Hamiltonian dicycles avoiding prescribed arcs in tournaments.

[BibT_eX]

[DOI]

Pierre Fraisse

,

Graphs Comb., 1987

On digraphs with no two disjoint directed cycles.

[BibT_eX]

[DOI]

Comb., 1987

Reflections on graph theory.

[BibT_eX]

[DOI]

J. Graph Theory, 1986

Interval representations of planar graphs.

[BibT_eX]

[DOI]

J. Comb. Theory B, 1986

Path and cycle sub-ramsey numbers and an edge-colouring conjecture.

[BibT_eX]

[DOI]

Gena Hahn

,

Discret. Math., 1986

Gabriel andrew dirac.

[BibT_eX]

[DOI]

J. Graph Theory, 1985

Subgraphs with large degrees and girth.

[BibT_eX]

[DOI]

Graphs Comb., 1985

Cycles through four edges in 3-connected cubic graphs.

[BibT_eX]

[DOI]

,

Derek A. Holton

,

Graphs Comb., 1985

Even Cycles in Directed Graphs.

[BibT_eX]

[DOI]

Eur. J. Comb., 1985

The 2-linkage problem for acyclic digraphs.

[BibT_eX]

[DOI]

Discret. Math., 1985

Subdivisions of graphs with large minimum degree.

[BibT_eX]

[DOI]

J. Graph Theory, 1984

A refinement of Kuratowski's theorem.

[BibT_eX]

[DOI]

J. Comb. Theory B, 1984

Graph decomposition with applications to subdivisions and path systems modulo k.

[BibT_eX]

[DOI]

J. Graph Theory, 1983

A theorem on paths in planar graphs.

[BibT_eX]

[DOI]

J. Graph Theory, 1983

Graph decomposition with constraints on the connectivity and minimum degree.

[BibT_eX]

[DOI]

J. Graph Theory, 1983

Deformations of plane graphs.

[BibT_eX]

[DOI]

J. Comb. Theory B, 1983

Girth in graphs.

[BibT_eX]

[DOI]

J. Comb. Theory B, 1983

Disjoint cycles in digraphs.

[BibT_eX]

[DOI]

Comb., 1983

Cycles in graphs of uncountable chromatic number.

[BibT_eX]

[DOI]

Comb., 1983

Circuits through specified edges.

[BibT_eX]

[DOI]

Roland Häggkvist

,

Discret. Math., 1982

A nine point theorem for 3-connected graphs.

[BibT_eX]

[DOI]

,

,

,

Comb., 1982

A remark on the factor theorems of lovász and tutte.

[BibT_eX]

[DOI]

J. Graph Theory, 1981

Nonseparating cycles in K-Connected graphs.

[BibT_eX]

[DOI]

J. Graph Theory, 1981

Kuratowski's theorem.

[BibT_eX]

[DOI]

J. Graph Theory, 1981

Cycles in digraphs- a survey.

[BibT_eX]

[DOI]

Jean-Claude Bermond

,

J. Graph Theory, 1981

Non-separating induced cycles in graphs.

[BibT_eX]

[DOI]

,

Bjarne Toft

J. Comb. Theory B, 1981

The size of connected hypergraphs with prescribed covering number.

[BibT_eX]

[DOI]

Béla Bollobás

,

J. Comb. Theory B, 1981

Planar cubic hypohamiltonian and hypotraceable graphs.

[BibT_eX]

[DOI]

J. Comb. Theory B, 1981

Hypotraceable digraphs.

[BibT_eX]

[DOI]

Martin Grötschel

,

,

Yoshiko Wakabayashi

J. Graph Theory, 1980

Hamiltonian-connected tournaments.

[BibT_eX]

[DOI]

J. Comb. Theory B, 1980

Planarity and duality of finite and infinite graphs.

[BibT_eX]

[DOI]

J. Comb. Theory B, 1980

2-Linked Graphs.

[BibT_eX]

[DOI]

Eur. J. Comb., 1980

On the number of Hamiltonian cycles in tournaments.

[BibT_eX]

[DOI]

Discret. Math., 1980

On the number of hamiltonian cycles in a maximal planar graph.

[BibT_eX]

[DOI]

Seifollah Louis Hakimi

,

Edward F. Schmeichel

,

J. Graph Theory, 1979

Three-regular subgraphs of four-regular graphs.

[BibT_eX]

[DOI]

,

,

,

J. Graph Theory, 1979

Counterexamples to faudree and schelp's conjecture on hamiltonian-connected graphs.

[BibT_eX]

[DOI]

J. Graph Theory, 1978

Distances in orientations of graphs.

[BibT_eX]

[DOI]

Vasek Chvátal

,

J. Comb. Theory B, 1978

On separating cycles in graphs.

[BibT_eX]

[DOI]

Discret. Math., 1978

Reconstructibility versus edge reconstructibility of infinite graphs.

[BibT_eX]

[DOI]

Discret. Math., 1978

Note on circuits containing specified edges.

[BibT_eX]

[DOI]

J. Comb. Theory B, 1977

Counterexamples to the edge reconstruction conjecture for infinite graphs.

[BibT_eX]

[DOI]

Discret. Math., 1977

An ore-type condition implying a digraph to be pancyclic.

[BibT_eX]

[DOI]

Discret. Math., 1977

A short proof of Meyniel's theorem.

[BibT_eX]

[DOI]

J. Adrian Bondy

,

Discret. Math., 1977

Planar and infinite hypohamiltonian and hypotraceable graphs.

[BibT_eX]

[DOI]

Discret. Math., 1976

Hypohamiltonian and hypotraceable graphs.

[BibT_eX]

[DOI]

Discret. Math., 1974

On hypohamiltonian graphs.

[BibT_eX]

[DOI]