Graph colourings and partitions

Theoretical Computer Science

Volumn 263, Issue 1-2, 2001, Pages 59-74

  Yegnanarayanan, V ^a,b  

^a Arulmigu Meenakshi Amman College of Engineering   (India)

^b NONE

Author keywords

Achromatic number; Chromatic number; Clique number; Colourings; Graphs; Independent set; Partition graph; Partitions; Perfect graphs; Pseudoachromatic number

Indexed keywords

COMPUTATIONAL COMPLEXITY; COMPUTATIONAL GEOMETRY; NUMBER THEORY; SET THEORY; THEOREM PROVING;

CLIQUE NUMBER; PSEUDOACHROMATIC NUMBER;

GRAPH THEORY;

EID: 0034926931     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(00)00231-0     Document Type: Article

References (44)

1. On the pseudoachromatic number of a graph
2. On the application of the properties of Galois fields to the problem of construction of hyper-Graceo-Latin squares, Sankhya, Indian
3. Indice achromatique des graphes multiparti complets et reguliers
4. The non-existence of certain finite projective planes
5. Graphical theorems of the Nordhaus-Gaddum class
6. The complexity of theorem-proving procedures
7. Colouring the real line
8. Research problem 77
9. Colouring prime distance graphs
10. Distance in graphs
11. Concerning the achromatic number of graphs
12. On the chromatic numbers of a graph and its complement
13. Maximum-minimum satze und verallemeinerte faktoren von graphen
14. Further results on the achromatic number
15. Bounds on the chromatic and achromatic numbers of complementary graphs in recent trends in combinatorics
16. On realizability of a set of integers as degrees of the vertices of a linear graph
17. Projective planes
18. The achromatic number of a graph
19. An interpolation theorem for graphical homomorphisms
20. Map colour theorems
21. On the edge achromatic numbers of complete graphs
22. On the geographical problem of four colours
23. Orthogonal Latin squares
24. On complementary graphs
25. Graph distance and Euclidean distance on the grid
26. On the sum of all distances in a graph or digraph
27. Representation of graphs by integers
28. On distances in chromatic graphs
29. Finite projective geometries
30. Non-desarguesian and non Pascalian geometries
31. Edge dominating sets in graphs
32. Extremal graphs in some colouring problems
33. Concerning psuedocomplete partitioning of graphs
34. The psuedoachromatic number of a graph
35. An existence result of Nordhaus-Gaddum class
36. A note on the existence of graphs with prescribed colouring parameters
37. On some properties of linear complexes