An algorithm to analyse the polynomial deck of the line graph of a triangle-free graph (Q2708243)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: An algorithm to analyse the polynomial deck of the line graph of a triangle-free graph |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An algorithm to analyse the polynomial deck of the line graph of a triangle-free graph |
scientific article |
Statements
27 January 2002
0 references
polynomial deck
0 references
algorithm
0 references
line graph
0 references
triangle-free graph
0 references
An algorithm to analyse the polynomial deck of the line graph of a triangle-free graph (English)
0 references
The polynomial deck of a graph \(G\) is the collection of characteristic polynomials of the vertex deleted subgraphs of \(G\). An algorithm recognizing the polynomial deck of the line graph of a triangle-free graph is presented.
0 references
