Pages that link to "Item:Q2264685"
From MaRDI portal
The following pages link to A \(max \{m, n \}\) algorithm for determining the graph H from its line graph G (Q2264685):
Displaying 4 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)
- Combinatorial optimization with 2-joins (Q765197) (← links)
- Exact algorithms for finding longest cycles in claw-free graphs (Q1939671) (← links)
- Solving the Weighted Stable Set Problem in Claw-Free Graphs via Decomposition (Q5501925) (← links)
