Recognition and isomorphism of tree-like P4-connected graphs-Reference-Cited by-同舟云学术

Recognition and isomorphism of tree-like P4-connected graphs

Published:2000-02 Issue:1-3 Volume:99 Page:295-315
ISSN:0166-218X
Container-title:Discrete Applied Mathematics
language:en
Short-container-title:Discrete Applied Mathematics

Author:

Babel Luitpold

Publisher

Elsevier BV

Subject

Applied Mathematics,Discrete Mathematics and Combinatorics

Reference22 articles.

1. Tree-like P4-connected graphs;Babel;Discrete Math.,1998

2. Triangulating graphs with few P4s;Babel;Discrete Appl. Math.,1998

3. L. Babel, S. Olariu, A new characterization of P4-connected graphs, in: Graph-Theoretic Concepts in Computer Science, 22nd International Workshop, WG’96, Lecture Notes in Computer Science, vol. 1197, Springer, Berlin, 1996, pp. 17–30.

4. L. Babel, S. Olariu, On the separable-homogeneous decomposition of graphs, in: Graph-Theoretic Concepts in Computer Science, 23rd International Workshop, WG’97, Lecture Notes in Computer Science, vol. 1335, Springer, Berlin, 1997, pp. 25–37.

5. On the structure of graphs with few P4s;Babel;Discrete Appl. Math.,1998

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

1. A Time-Based Solution for the Graph Isomorphism Problem;Circuits, Systems, and Signal Processing;2019-10-05

2. Fully Polynomial FPT Algorithms for Some Classes of Bounded Clique-width Graphs;ACM Transactions on Algorithms;2019-07-19

3. On clique-colouring of graphs with few P4’s;Journal of the Brazilian Computer Society;2011-12-22

4. On the fixed parameter complexity of graph enumeration problems definable in monadic second-order logic;Discrete Applied Mathematics;2001-02