Pages that link to "Item:Q5902530"
From MaRDI portal
The following pages link to Graph-Theoretic Concepts in Computer Science (Q5902530):
Displaying 11 items.
- On Gromov's method of selecting heavily covered points (Q742816) (← links)
- Computational complexity of covering three-vertex multigraphs (Q897866) (← links)
- Subgraph complementation (Q2182091) (← links)
- On the Hardness of Switching to a Small Number of Edges (Q2817858) (← links)
- Switching to Hedgehog-Free Graphs Is NP-Complete (Q3010425) (← links)
- Graph labelings derived from models in distributed computing: A complete complexity classification (Q3100700) (← links)
- (Q5100145) (← links)
- LOCALLY-BALANCED $k$-PARTITIONS OF GRAPHS (Q5100179) (← links)
- Partial complementation of graphs (Q5116485) (← links)
- On Switching to <i>H</i>‐Free Graphs (Q5417832) (← links)
- On the existence of funneled orientations for classes of rooted phylogenetic networks (Q6652436) (← links)
