Sciweavers

157 search results - page 16 / 32

» Frugal Colouring of Graphs

57

JCT
2006

47views more JCT 2006»

A map colour theorem for the union of graphs

14 years 11 months ago

A map colour theorem for the union of graphs

Download www.imfm.si

Michael Stiebitz, Riste Skrekovski

claim paper

Read More »

70

ENDM
2007

78views more ENDM 2007»

Colourings of the Cartesian Product of Graphs and Multiplicative Sidon Sets

14 years 11 months ago

Colourings of the Cartesian Product of Graphs and Multiplicative Sidon Sets

Download www.ms.unimelb.edu.au

Attila Pór, David R. Wood

claim paper

Read More »

86

CC
2000
Springer

90views System Software» more CC 2000»

The complexity of counting colourings and independent sets in sparse graphs and hypergraphs

14 years 11 months ago

The complexity of counting colourings and independent sets in sparse graphs and hypergraphs

Download web.maths.unsw.edu.au

Catherine S. Greenhill

claim paper

Read More »

63

Voted

DMTCS
2002

100views Mathematics» more DMTCS 2002»

Upper bounds on the non-3-colourability threshold of random graphs

14 years 11 months ago

Upper bounds on the non-3-colourability threshold of random graphs

Download www.dmtcs.org

Nikolaos Fountoulakis, Colin McDiarmid

claim paper

Read More »

114

ILP
2007
Springer

203views Automated Reasoning» more ILP 2007»

Structural Statistical Software Testing with Active Learning in a Graph

15 years 6 months ago

Structural Statistical Software Testing with Active Learning in a Graph

Download hal.archives-ouvertes.fr

Structural Statistical Software Testing (SSST) exploits the control ﬂow graph of the program being tested to construct test cases. Speciﬁcally, SSST exploits the feasible paths...

Nicolas Baskiotis, Michèle Sebag

claim paper

Read More »

« Prev « First page 16 / 32 Last » Next »