The strong chromatic index of graphs
暂无分享,去创建一个
[1] Joel Spencer. Optimally ranking unrankable tournaments , 1980 .
[2] Jennifer J. Quinn,et al. Strong chromatic index of subset graphs , 1997, J. Graph Theory.
[3] Subramanian Ramanathan,et al. Scheduling algorithms for multi-hop radio networks , 1992, SIGCOMM '92.
[4] B. Reed. Graph Colouring and the Probabilistic Method , 2001 .
[5] Noga Alon,et al. The Probabilistic Method , 2015, Fundamentals of Ramsey Theory.
[6] Kathryn Fraughnaugh,et al. Introduction to graph theory , 1973, Mathematical Gazette.
[7] Zsolt Tuza,et al. The maximum number of edges in 2K2-free graphs of bounded degree , 1990, Discret. Math..
[8] Noga Alon,et al. Coloring Graphs with Sparse Neighborhoods , 1999, J. Comb. Theory B.
[9] Arunabha Sen,et al. A new model for scheduling packet radio networks , 1996, Proceedings of IEEE INFOCOM '96. Conference on Computer Communications.
[10] Jean-Claude Bermond,et al. Surveys in Combinatorics: GRAPHS AND INTERCONNECTION NETWORKS: DIAMETER AND VULNERABILITY , 1983 .
[11] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .
[12] David S. Johnson,et al. The NP-Completeness Column: An Ongoing Guide , 1982, J. Algorithms.
[13] Paul Erdös,et al. On the existence of two non-neighboring subgraphs in a graph , 1985, Comb..
[14] Nicholas C. Wormald,et al. The asymptotic distribution of short cycles in random regular graphs , 1981, J. Comb. Theory, Ser. B.
[15] Jean-Claude Bermond,et al. Dense bus networks of diameter 2 , 1994, Interconnection Networks and Mapping and Scheduling Parallel Computations.
[16] William T. Trotter,et al. Induced matchings in cubic graphs , 1993, J. Graph Theory.
[17] Lars D@vling Andersen. The strong chromatic index of a cubic graph is at most 10 , 1992, Discret. Math..
[18] Paul Erdös,et al. Problems and results in combinatorial analysis and graph theory , 1988, Discret. Math..
[19] S. Thomas McCormick,et al. Optimal approximation of sparse hessians and its equivalence to a graph coloring problem , 1983, Math. Program..
[20] Stanley Wagon,et al. A bound on the chromatic number of graphs without certain induced subgraphs , 1980, J. Comb. Theory, Ser. B.
[21] Bruce A. Reed. The list colouring constants , 1999, J. Graph Theory.
[22] Jeong Han Kim. On Brooks' Theorem for Sparse Graphs , 1995, Comb. Probab. Comput..
[23] Michel Talagrand. A new isoperimetric inequality for product measure and the tails of sums of independent random variables , 1991 .
[24] Mohammad Mahdian,et al. The strong chromatic index of C 4 -free graphs , 2000 .
[25] Bruce A. Reed,et al. A Bound on the Strong Chromatic Index of a Graph, , 1997, J. Comb. Theory B.