Sciweavers

2 search results - page 1 / 1
» [r, s, t]-Chromatic numbers and hereditary properties of gra...
Sort
View
DM
2007
66views more  DM 2007»
13 years 4 months ago
[r, s, t]-Chromatic numbers and hereditary properties of graphs
Arnfried Kemnitz, Massimiliano Marangio, Peter Mih...
ESA
1999
Springer
95views Algorithms» more  ESA 1999»
13 years 9 months ago
A Fast General Methodology for Information - Theoretically Optimal Encodings of Graphs
We propose a fast methodology for encoding graphs with information-theoretically minimum numbers of bits. Specifically, a graph with property π is called a π-graph. If π satis...
Xin He, Ming-Yang Kao, Hsueh-I Lu