Planar graphs with least chromatic coefficients

Discrete Mathematics

Volumn 172, Issue 1-3, 1997, Pages 121-130

  Sakaloglu, A ^a   Satyanarayana, A ^a  

^a Stevens Institute of Technology   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 30244472486     PISSN: 0012365X     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0012-365X(96)00275-0     Document Type: Article

References (5)

1. F. Boesch, A. Satyanarayana and C. Suffel, Least reliable networks and the reliability domination, IEEE Trans. Commun. 38 (1990) 2004-2009.
2. G.A. Dirac, On rigid circuit graphs, Abh. Math. Sem. Univ. Hamburgh 25 (1967) 71-76.
3. F. Harary, Graph Theory (Addison-Wesley, Reading, MA, 1969).
4. J. Rodriguez and A. Satyanarayana, Chromatic polynomials with least coefficients, this issue.
5. A. Sakaloglu and A. Satyanarayana, Graphs with least number of colorings, J. Graph Theory 19 (1995) 523-533.