Author:
Jelínková Eva,Kratochvíl Jan
Publisher
Springer Berlin Heidelberg
Reference14 articles.
1. Ehrenfeucht, A., Hage, J., Harju, T., Rozenberg, G.: Pancyclicity in switching classes. Inform. Process. Letters 73, 153–156 (2000)
2. Lecture Notes in Computer Science;A. Ehrenfeucht,2000
3. Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W.H. Freeman, New York (1979)
4. Hage, J., Harju, T.: A characterization of acyclic switching classes of graphs using forbidden subgraphs. SIAM J. Discrete Math. 18, 159–176 (2004)
5. Lecture Notes in Computer Science;J. Hage,2002
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. A new operation on partially ordered sets;Journal of Combinatorial Theory, Series A;2013-09
2. On Switching toH-Free Graphs;Journal of Graph Theory;2013-06-07
3. Switching to Hedgehog-Free Graphs Is NP-Complete;Lecture Notes in Computer Science;2011