Pages that link to "Item:Q2848780"
From MaRDI portal
The following pages link to Discontinuities in the complexities of some graph recognition problems (Q2848780):
Displaying 5 items.
- Recognizing tough graphs is NP-hard (Q918697) (← links)
- Graph approach to solving problems of combinatorial recognition (Q1699396) (← links)
- Recognizing brittle graphs: Remarks on a paper of Hoàng and Khouzam (Q1814095) (← links)
- Об одной задаче распознавания предфрактального графа (Q5220602) (← links)
- Representing graphs by disks and balls (a survey of recognition-complexity results) (Q5931448) (← links)