Subject
General Computer Science,Theoretical Computer Science
Reference14 articles.
1. On the structure of graphs with few P4s;Babel;Discrete Appl. Math.,1998
2. Efficient algorithms for graphs with few P4′s;Babel;Discrete Math.,2001
3. Vertex-distinguishing edge-colorings of graphs;Balister;J. Graph Theory,2003
4. Vertex-distinguishing proper edge-colorings;Burris;J. Graph Theory,1997
5. Observability of a graph;Cerný;Math. Slovaca,1996
Cited by
4 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献