Jun 17, 2005 · The k-path graph P k (H) of a graph H has all length-k paths of H as vertices; two such vertices are adjacent in the new graph if their union ...
Cruical is the fact that underlying graphs of line digraphs, as well as k-path graphs contain only 'few' large bicliques (i.e. bicliques containing/(2,2). 1 ...
Bibliographic details on Bicliques in Graphs II: Recognizing k-Path Graphs and Underlying Graphs of Line Digraphs.
In this paper we give a (nonpolynomial) recognition algorithm for k -path graphs, for every integer k⩾2 . The algorithm runs in polynomial time if we are only ...
Bicliques in Graphs II: Recognizing k-Path Graphs and Underlying Graphs of Line Digraphs · Erich Prisner. Mathematics. International Workshop on Graph-Theoretic ...
The k-path graph Pk (H) of a graph H has all length-k paths of H as vertices; two such vertices are adjacent in the new graph if their union forms a path or ...
By a k-edge of a graph we mean a complete subgraph with k vertices or a clique with fewer than k vertices. The k-edge graph Δ k (G) of a graph G is defined as ...
People also ask
What is K graph in graph theory?
What is a bipartite graph in graph theory?
Aug 25, 2009 · A biclique of a graph G is a maximal induced complete bipartite subgraph of G. Given a graph G, the biclique matrix of G is a {0,1,−1} ...
Bicliques in graphs II: Recognizing k-path graphs and underlying graphs of line digraphs, Proceedings of WG97, LNCS 1335 (1997) 273-287;. Intersection ...
Bicliques in Graphs II: Recognizing k-Path Graphs and Underlying Graphs of Line Digraphs. Conference Paper. Jun 1997. Erich Prisner. Given an ...