NP-Completeness and One Polynomial Subclass of the Two-Step Graph Colouring Problem-Reference-Cited by-同舟云学术

NP-Completeness and One Polynomial Subclass of the Two-Step Graph Colouring Problem

Published:2020-12 Issue:7 Volume:54 Page:685-696
ISSN:0146-4116
Container-title:Automatic Control and Computer Sciences
language:en
Short-container-title:Aut. Control Comp. Sci.

Author:

Medvedeva N. S.,Smirnov A. V.

Publisher

Allerton Press

Subject

Signal Processing,Control and Systems Engineering,Software

Link

http://link.springer.com/content/pdf/10.3103/S0146411620070159.pdf

Reference6 articles.

1. Korsakov, S.V., Smirnov, A.V., and Sokolov, V.A., Principles of organizing the interoperability of equipollent nodes in a wireless mesh-network with time division multiple access, Autom. Control Comput. Sci., 2016, vol. 50, no. 6, pp. 415–422.

2. Harary, F., Graph Theory, Addison-Wesley Pub. Co., 1969.

3. Garey, M.R. and Johnson, D.S., Computers and Intractability: A Guide to the Theory of NP-Completeness, W.H. Freeman and Company, 1979.

4. Rublev, V.S., Elementy teorii grafov. Izomorfizm, planarnost’, marshruty v grafakh (Elements of Graph Theory. Isomorphism, Planarity, Routes in Graphs), Yaroslavl: Yarosl. Gos. Univ., 2010.

5. Umans, C. and Lenhart, W., Hamiltonian cycles in solid grid graphs, Proceedings of the 38th Annual IEEE Symposium on Foundations of Computer Science (FOCS), 1997, pp. 496–505.

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

1. Two-Step Coloring of Grid Graphs of Different Types;Automatic Control and Computer Sciences;2023-12

2. Two-Step Colouring of Grid Graphs of Different Types;Modeling and Analysis of Information Systems;2022-09-25