Bicliques in graphs II: Recognizing k-path graphs and underlying graphs of line digraphs

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1335, Issue , 1997, Pages 273-287

  Prisner, Erich ^a  

^a UNIVERSITY OF HAMBURG   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

DIRECTED GRAPHS;

BIPARTITE SUBGRAPHS; K-PATH GRAPH; LINE DIGRAPH; MINIMUM DEGREE; NP COMPLETE; TIME ALGORITHMS; UNDERLYING GRAPHS; UNDIRECTED GRAPH;

GRAPHIC METHODS;

EID: 84949636844     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/bfb0024504     Document Type: Conference Paper

References (13)

1. R.E.L. Aldred, M.N. Ellingham, R. Hemminger, P. Jipsen, P3-isomorphisms for graphs, preprint 1995.
2. H.-J. Broersma, C. Hoede, Path graphs, J. Graph Theory 13 (1989) 427-444.
3. V. Chvatal, C. Ebenegger, A note on line digraphs and the directed max-cut problem, Discrete Applied Math. 29 (1990) 165-170.
4. M.A. Fiol, J.L.A. Yebra, I. Alegre, Line digraph iterations and the (d, k) digraph problem, IEEE Transactions on Computers C-33 (1984) 400-403.
5. P.G.H. Lehot, An optimal algorithm to detect a line graph and output its root graph, J. Assoc. Comput. Mach. 21 (1974) 569-575.
6. Xueliang Li, Isomorphisms of P3-graphs, J. Graph Theory 21 (1996) 81-85.
7. H. Li, Y. Lin, On the characterization of path graph, J. Graph Theory 17 (1993) 463-466.
8. E. Prisner, Graphs with few cliques, in: Graph Theory, Combinatorics, and Applications: Proceedings of 7th Quadrennial International Conference on the Theory and Applications of Graphs (Y. Alavi, A. Schwenk ed.) John Wiley and Sons, Inc. (1995) 945-956;
9. E. Prisner, Bicliques in graphs I: Bounds on their number, (1996) submitted.
10. E. Prisner, Graph Dynamics, Pitman Research Notes in Mathematics Series 338 (1995), Longman, Essex.
11. N.D. Roussopoulos, A max{m,n} algorithm for determining the graph H from its line graph G, Inform. Process. Lett. 2 (1973) 108-112.
12. S. Tsukiyama, M. Ide, M. Aiyoshi, I. Shirawaka, A new algorithm for generating all the independent sets, SIAM J. Computing 6 (1977) 505-517.
13. J.L. Villar, The underlying graph of a line digraph, Discrete Applied Math. 37/38 (1992) 525-538.