A very simple algorithm for estimating the number of k-colourings of a low-degree graph

Algorithms for graphs with small octopus

Kratsch, D.
Fomin, F.V.
Muller, H.
Leeds Univ. (United Kingdom). School of Computer Studies

January 2001

SIGLEAvailable from British Library Document Supply Centre-DSC:7769.555(2001/12) / BLDSC - British L...

K-l Frequency Assignment: Methods and Algorithms

D. H. Smith
S. M. Allen
Wales U. K

December 2014

In this tutorial paper the representation of the frequency assignment problem as a generalised graph...

Parallel O(log(n))-time edge-colouring of trees and Halin graphs

Gibbons, A.
Israeli, A.
Rytter, W
Warwick Univ., Coventry (United Kingdom). Dept. of Computer Science

January 1987

SIGLEAvailable from British Library Document Supply Centre- DSC:7769.09285(WU-DCS-RR--105) / BLDSC -...

A multilevel approach to the graph colouring problem

Walshaw, C.
Greenwich Univ., London (United Kingdom). Centre for Numerical Modelling and Process Analysis

January 2001

SIGLEAvailable from British Library Document Supply Centre-DSC:6370.933(no 01/69) / BLDSC - British ...

Graph colourings using structured colour sets

Johnson, A.

January 2001

Available from British Library Document Supply Centre-DSC:DXN046348 / BLDSC - British Library Docume...

Graph-colouring algorithms with applications to timetabling problems

Abou Naaj, M.S.

January 1983

SIGLELD:D49375/84 / BLDSC - British Library Document Supply CentreGBUnited Kingdo

Edge-colouring of graphs

Chetwynd, A

January 1984

SIGLEAvailable from British Library Document Supply Centre- DSC:D52161/84 / BLDSC - British Library ...

Efficient algorithms for listing unlabeled graphs

Henderson, L.A
Edinburgh Univ. (United Kingdom). Dept. of Computer Science

January 1990

Available from British Library Document Supply Centre- DSC:4534.9203(EU-CSR--7-90) / BLDSC - British...

Analysis of the mean field annealing algorithm for graph colouring

Shawe-Taylor, J.
Zerovnik, J
Royal Holloway University of London (United Kingdom). Dept. of Computer Science

January 1993

SIGLEAvailable from British Library Document Supply Centre- DSC:8717.8085(RHUL-CSD-TR--93-13) / BLDS...

INCLUSION–EXCLUSION BASED ALGORITHMS FOR

Graph Colouring
Thore Husfeldt

August 2015

Abstract. We present a deterministic algorithm producing the number of k-colourings of a graph on n ...

2-colourings and other combinatorial problems

Tarlow, B.

January 1998

SIGLEAvailable from British Library Document Supply Centre-DSC:DXN020626 / BLDSC - British Library D...

Graph colouring with Fewer Colours than the Chromatic Number via Combinations of Colours

Nicolas, Ian Kit

January 2016

Please note that this paper has been submitted for publication in a journal and is unavailable at th...

Edge-colouring and I-factors in graphs

Lienart, E.A.S.

January 2000

SIGLEAvailable from British Library Document Supply Centre-DSC:DXN038690 / BLDSC - British Library D...

An algorithmic framework for colouring locally sparse graphs

Davies, Ewan
Kang, Ross
Pirot, François
Sereni, Jean-Sébastien

April 2020

We develop an algorithmic framework for graph colouring that reduces the problem to verifying a loca...

Pre-processings and Linear-Decomposition Algorithm to Solve the k-Colorability Problem

Lucet, Corinne
Mendes, Florence
Moukrim, Aziz

May 2004

International audienceWe are interested in the graph coloring problem. We studied the effectiveness ...

Algorithms for graphs with small octopus

Kratsch, D.
Fomin, F.V.
Muller, H.
Leeds Univ. (United Kingdom). School of Computer Studies

January 2001

SIGLEAvailable from British Library Document Supply Centre-DSC:7769.555(2001/12) / BLDSC - British L...

K-l Frequency Assignment: Methods and Algorithms

D. H. Smith
S. M. Allen
Wales U. K

December 2014

In this tutorial paper the representation of the frequency assignment problem as a generalised graph...

Parallel O(log(n))-time edge-colouring of trees and Halin graphs

Gibbons, A.
Israeli, A.
Rytter, W
Warwick Univ., Coventry (United Kingdom). Dept. of Computer Science

January 1987

SIGLEAvailable from British Library Document Supply Centre- DSC:7769.09285(WU-DCS-RR--105) / BLDSC -...

A multilevel approach to the graph colouring problem

Walshaw, C.
Greenwich Univ., London (United Kingdom). Centre for Numerical Modelling and Process Analysis

January 2001

SIGLEAvailable from British Library Document Supply Centre-DSC:6370.933(no 01/69) / BLDSC - British ...

Graph colourings using structured colour sets

Johnson, A.

January 2001

Available from British Library Document Supply Centre-DSC:DXN046348 / BLDSC - British Library Docume...

Graph-colouring algorithms with applications to timetabling problems

Abou Naaj, M.S.

January 1983

SIGLELD:D49375/84 / BLDSC - British Library Document Supply CentreGBUnited Kingdo

Edge-colouring of graphs

Chetwynd, A

January 1984

SIGLEAvailable from British Library Document Supply Centre- DSC:D52161/84 / BLDSC - British Library ...

Efficient algorithms for listing unlabeled graphs

Henderson, L.A
Edinburgh Univ. (United Kingdom). Dept. of Computer Science

January 1990

Available from British Library Document Supply Centre- DSC:4534.9203(EU-CSR--7-90) / BLDSC - British...

Analysis of the mean field annealing algorithm for graph colouring

Shawe-Taylor, J.
Zerovnik, J
Royal Holloway University of London (United Kingdom). Dept. of Computer Science

January 1993

SIGLEAvailable from British Library Document Supply Centre- DSC:8717.8085(RHUL-CSD-TR--93-13) / BLDS...

INCLUSION–EXCLUSION BASED ALGORITHMS FOR

Graph Colouring
Thore Husfeldt

August 2015

Abstract. We present a deterministic algorithm producing the number of k-colourings of a graph on n ...

2-colourings and other combinatorial problems

Tarlow, B.

January 1998

SIGLEAvailable from British Library Document Supply Centre-DSC:DXN020626 / BLDSC - British Library D...

Graph colouring with Fewer Colours than the Chromatic Number via Combinations of Colours

Nicolas, Ian Kit

January 2016

Please note that this paper has been submitted for publication in a journal and is unavailable at th...

Edge-colouring and I-factors in graphs

Lienart, E.A.S.

January 2000

SIGLEAvailable from British Library Document Supply Centre-DSC:DXN038690 / BLDSC - British Library D...

An algorithmic framework for colouring locally sparse graphs

Davies, Ewan
Kang, Ross
Pirot, François
Sereni, Jean-Sébastien

April 2020

We develop an algorithmic framework for graph colouring that reduces the problem to verifying a loca...

Pre-processings and Linear-Decomposition Algorithm to Solve the k-Colorability Problem

Lucet, Corinne
Mendes, Florence
Moukrim, Aziz

May 2004

International audienceWe are interested in the graph coloring problem. We studied the effectiveness ...

Algorithms for graphs with small octopus

Kratsch, D.
Fomin, F.V.
Muller, H.
Leeds Univ. (United Kingdom). School of Computer Studies

January 2001

SIGLEAvailable from British Library Document Supply Centre-DSC:7769.555(2001/12) / BLDSC - British L...

K-l Frequency Assignment: Methods and Algorithms

D. H. Smith
S. M. Allen
Wales U. K

December 2014

In this tutorial paper the representation of the frequency assignment problem as a generalised graph...

Parallel O(log(n))-time edge-colouring of trees and Halin graphs

Gibbons, A.
Israeli, A.
Rytter, W
Warwick Univ., Coventry (United Kingdom). Dept. of Computer Science

January 1987

SIGLEAvailable from British Library Document Supply Centre- DSC:7769.09285(WU-DCS-RR--105) / BLDSC -...

A very simple algorithm for estimating the number of k-colourings of a low-degree graph

Abstract

Extracted data

A very simple algorithm for estimating the number of k-colourings of a low-degree graph

Abstract

Extracted data

Related items

Related items