Kr-Free Uniquely Vertex Colorable Graphs with Minimum Possible Edges-Reference-Cited by-同舟云学术

Kr-Free Uniquely Vertex Colorable Graphs with Minimum Possible Edges

Published:2001-07 Issue:2 Volume:82 Page:316-318
ISSN:0095-8956
Container-title:Journal of Combinatorial Theory, Series B
language:en
Short-container-title:Journal of Combinatorial Theory, Series B

Author:

Akbari S.,Mirrokni V.S.,Sadjad B.S.

Publisher

Elsevier BV

Subject

Computational Theory and Mathematics,Discrete Mathematics and Combinatorics,Theoretical Computer Science

Reference6 articles.

1. Uniquely colorable graphs with large girth;Bollobás;Canad. J. Math.,1976

2. On uniquely 3-colorable graphs;Chao;Discrete Math.,1993

3. P. Erdős, Some new applications of probability methods to combinatorial analysis and graph theory, in Proceedings, 5th SE Conference on Combinatorics, Graph Theory and Computing, Boca Raton, Congress on Numbers, Vol. 10, pp. 39–51.

4. Uniquely colorable graphs;Harary;J. Combin. Theory,1969

5. On uniquely colorable graphs without short cycles;Nešetřil;Časopis Pěst. Mat.,1973

Cited by 6 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. A construction of uniquely colourable graphs with equal colour class sizes;Discrete Applied Mathematics;2021-11

2. Constructions of Uniquely 3-Colorable Graphs;2016 IEEE First International Conference on Data Science in Cyberspace (DSC);2016-06

3. On two generalizations of the Alon–Tarsi polynomial method;Journal of Combinatorial Theory, Series B;2011-11

4. Algebraic characterization of uniquely vertex colorable graphs;Journal of Combinatorial Theory, Series B;2008-03

5. Construction of uniquely vertex k-colorable graphs with minimum possible size;Journal of Shanghai University (English Edition);2007-10