A. S. Pedersen

activity

20082011

most citedOn graphs double-critical with respect to the colouring number

1 citations · 1 across the 5 of their papers we have counts for

collaborators

5 papers

math.CO2011★ 1 cited

On graphs double-critical with respect to the colouring number

Matthias Kriesell, Anders Sune Pedersen

The colouring number col(G) of a graph G is the smallest integer k for which there is an ordering of the vertices of G such that when removing the vertices of G in the specified or…

math.CO2010

Complete and almost complete minors in double-critical 8-chromatic graphs

Anders Sune Pedersen

A connected $k$ -chromatic graph $G$ is said to be {\it double-critical} if for all edges $uv$ of $G$ the graph $G - u - v$ is $(k - 2)$ -colourable. A longstanding conjecture of Erdős…

math.CO2008

Double-critical graphs and complete minors

Ken-ichi Kawarabayashi, Anders Sune Pedersen, Bjarne Toft

A connected $k$ -chromatic graph $G$ is double-critical if for all edges $uv$ of $G$ the graph $G - u - v$ is $(k - 2)$ -colourable. The only known double-critical $k$ -chromatic graph…

math.CO2008

A Basic Elementary Extension of the Duchet-Meyniel Theorem

Anders Sune Pedersen, Bjarne Toft

The Conjecture of Hadwiger implies that the Hadwiger number $h$ times the independence number $α$ of a graph is at least the number of vertices $n$ of the graph. In 1982 Duchet and…

math.CO2008

A Remark on Triangle-Critical Graphs

Anders Sune Pedersen

A connected $k$ -chromatic graph $G$ with $k \geq 3$ is said to be triangle-critical, if every edge of $G$ is contained in an induced triangle of $G$ and the removal of any triangle…