Funder
National Research, Development and Innovation Office — NKFIH
Subject
Applied Mathematics,Discrete Mathematics and Combinatorics
Reference21 articles.
1. On the approximation of finding a(nother) Hamiltonian cycle in cubic Hamiltonian graphs;Bazgan;J. Algorithms,1999
2. On the Existence and Determination of Satisfactory Partitions in a Graph;Bazgan,2003
3. Satisfactory graph partition, variants, and generalizations;Bazgan;European J. Oper. Res.,2010
4. Small alliances in graphs;Carvajal,2007
5. Approximation hardness of edge dominating set problems;Chlebík;J. Comb. Optim.,2006
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献