An Efficient Way to Determine the Chromatic Number of a Graph Directly from its Input Realizable Sequence
暂无分享,去创建一个
Abhisek Paul | Paritosh Bhattacharya | Prantik Biswas | Shreyasi Das | Chumki Acharya | Nirupam Chakrabarti | P. Bhattacharya | Prantik Biswas | Abhisek Paul | Chumki Acharya | Nirupam Chakrabarti | Shreyasi Das
[1] J. A. Bondy,et al. Graph Theory with Applications , 1978 .
[2] P. Bhattacharya,et al. Application of (0, 1)-Matrix in Determination of Graphic Realization of Non-Increasing Positive Integer Sequence , 2015, ICARCSET '15.
[3] D. Cvetkovic,et al. Spectra of Graphs: Theory and Applications , 1997 .
[4] Himanshu Tyagi,et al. A simple criterion on degree sequences of graphs , 2008, Discret. Appl. Math..
[5] L. Hogben. Handbook of Linear Algebra , 2006 .
[6] Han Hoogeveen,et al. Seven criteria for integer sequences being graphic , 1991, J. Graph Theory.
[7] D. R. Fulkerson,et al. Some Properties of Graphs with Multiple Edges , 1965, Canadian Journal of Mathematics.
[8] Amitabha Tripathi,et al. A note on a theorem of Erdös & Gallai , 2003, Discret. Math..
[9] H. Ryser. Combinatorial Properties of Matrices of Zeros and Ones , 1957, Canadian Journal of Mathematics.
[10] Daniel J. Kleitman,et al. Algorithms for constructing graphs and digraphs with given valences and factors , 1973, Discret. Math..
[11] S. Hakimi. On Realizability of a Set of Integers as Degrees of the Vertices of a Linear Graph. I , 1962 .
[12] H. Wilf. The Eigenvalues of a Graph and Its Chromatic Number , 1967 .
[13] Geir Dahl,et al. A remark concerning graphical sequences , 2005, Discret. Math..
[14] B. Bollobás,et al. Extremal Graph Theory , 2013 .