AbstractWe prove that a connected graph with at least nine vertices is a line graph if and only if it does not contain any of the seven given graphs as an induced subgraph. We also show that the number seven cannot be reduced even if the number of vertices is increased
Given a graph with n points and m lines. If each vertex is labeled, then it can be constructed many ...
Can a directed graph be completed to a directed line graph? If possible, how many arcs must be added...
AbstractA graph is polar if the vertex set can be partitioned into A and B in such a way that the su...
AbstractWe prove that a connected graph with at least nine vertices is a line graph if and only if i...
AbstractBeineke and Robertson independently characterized line graphs in terms of nine forbidden ind...
AbstractBeineke and Robertson independently characterized line graphs in terms of nine forbidden ind...
The line graph operation, in which the edges of one graph are taken as the vertices of a new graph, ...
AbstractLet G be a graph Sedláček [2] has shown that the line graph of G is planar if and only if G ...
AbstractLet G be a graph Sedláček [2] has shown that the line graph of G is planar if and only if G ...
Title from first page of PDF file (viewed November 29, 2010)Includes bibliographical references (p. ...
AbstractWe characterize the triangle-free graphs with neither induced path of six vertices nor induc...
International audienceA graph is a path graph if it is the intersection graph of a family of subpath...
AbstractThe following two theorems are proved: (1) A graph G with at least n + 1 points, n ≥ 2, is n...
AbstractThe following two theorems are proved: (1) A graph G with at least n + 1 points, n ≥ 2, is n...
AbstractWe show that any line graph contains a set of three vertices which is not included in a smal...
Given a graph with n points and m lines. If each vertex is labeled, then it can be constructed many ...
Can a directed graph be completed to a directed line graph? If possible, how many arcs must be added...
AbstractA graph is polar if the vertex set can be partitioned into A and B in such a way that the su...
AbstractWe prove that a connected graph with at least nine vertices is a line graph if and only if i...
AbstractBeineke and Robertson independently characterized line graphs in terms of nine forbidden ind...
AbstractBeineke and Robertson independently characterized line graphs in terms of nine forbidden ind...
The line graph operation, in which the edges of one graph are taken as the vertices of a new graph, ...
AbstractLet G be a graph Sedláček [2] has shown that the line graph of G is planar if and only if G ...
AbstractLet G be a graph Sedláček [2] has shown that the line graph of G is planar if and only if G ...
Title from first page of PDF file (viewed November 29, 2010)Includes bibliographical references (p. ...
AbstractWe characterize the triangle-free graphs with neither induced path of six vertices nor induc...
International audienceA graph is a path graph if it is the intersection graph of a family of subpath...
AbstractThe following two theorems are proved: (1) A graph G with at least n + 1 points, n ≥ 2, is n...
AbstractThe following two theorems are proved: (1) A graph G with at least n + 1 points, n ≥ 2, is n...
AbstractWe show that any line graph contains a set of three vertices which is not included in a smal...
Given a graph with n points and m lines. If each vertex is labeled, then it can be constructed many ...
Can a directed graph be completed to a directed line graph? If possible, how many arcs must be added...
AbstractA graph is polar if the vertex set can be partitioned into A and B in such a way that the su...
DOI
Add to ORKG