Pages that link to "Item:Q1924495"
From MaRDI portal
The following pages link to On the recognition complexity of some graph properties (Q1924495):
Displaying 15 items.
- An asymptotic bound for the complexity of monotone graph properties (Q653841) (← links)
- The complexity of regular subgraph recognition (Q912615) (← links)
- Recognition of graphs by automata (Q1349690) (← links)
- The recognition problem for line bigraphs (Q1398267) (← links)
- On the recognition of families of graphs with local computations (Q1891139) (← links)
- On the complexity of recognizing a class of perfectly orderable graphs (Q1917290) (← links)
- Some recognition problems related to graph isomorphism (Q3470503) (← links)
- (Q3769993) (← links)
- Some Results on Elusive Graph Properties (Q4291554) (← links)
- (Q4677945) (← links)
- (Q4714508) (← links)
- (Q5354995) (← links)
- Representing graphs by disks and balls (a survey of recognition-complexity results) (Q5931448) (← links)
- On the elusiveness of Hamiltonian property (Q5931908) (← links)
- Efficiently recognizing graphs with equal independence and annihilation numbers (Q6161447) (← links)