Pages that link to "Item:Q3201774"
From MaRDI portal
The following pages link to An efficient reconstruction of a graph from its line graph in parallel (Q3201774):
Displayed 8 items.
- A finite characterization and recognition of intersection graphs of hypergraphs with rank at most 3 and multiplicity at most 2 in the class of threshold graphs (Q505460) (← links)
- ILIGRA: an efficient inverse line graph algorithm (Q894425) (← links)
- Finding the root graph through minimum edge deletion (Q2028798) (← links)
- Intersection graph of maximal stars (Q2197473) (← links)
- Minimizing the Hamming distance between a graph and a line-graph to discover the topology of an electrical network (Q5119373) (← links)
- Edge intersection graphs of linear 3-uniform hypergraphs (Q5899371) (← links)
- Edge intersection graphs of linear 3-uniform hypergraphs (Q5902100) (← links)
- New results and open problems in line graphs (Q6101461) (← links)