Pages that link to "Item:Q442382"
From MaRDI portal
The following pages link to On the hardness of recognizing triangular line graphs (Q442382):
Displaying 8 items.
- Forests and trees among Gallai graphs (Q472964) (← links)
- Generalized line graphs: Cartesian products and complexity of recognition (Q888591) (← links)
- Edge clique partition in \((k,\ell)\)-graphs (Q2243139) (← links)
- Gallai and anti-Gallai graph operators (Q2413397) (← links)
- Triangle packings and transversals of some \(K_{4}\)-free graphs (Q2413632) (← links)
- A survey of the studies on Gallai and anti-Gallai graphs (Q4957545) (← links)
- On an edge partition and root graphs of some classes of line graphs (Q5006610) (← links)
- EULERIAN AND HAMILTONIAN PROPERTIES OF GALLAI AND ANTI-GALLAI TOTAL GRAPHS (Q5140108) (← links)
