Pages that link to "Item:Q1911841"
From MaRDI portal
The following pages link to On the complexity of recognizing Hamming graphs and related classes of graphs (Q1911841):
Displaying 14 items.
- Recognizing Hamming graphs in linear time and space (Q287143) (← links)
- Recognizing median graphs in subquadratic time (Q1285576) (← links)
- Clique-gated graphs (Q1356418) (← links)
- Wiener number of vertex-weighted graphs and a chemical application (Q1377617) (← links)
- The majority strategy on graphs (Q1377621) (← links)
- Cubic inflation, mirror graphs, regular maps, and partial cubes (Q1422394) (← links)
- Factoring cardinal product graphs in polynomial time (Q1584444) (← links)
- Distances in benzenoid systems: Further developments (Q1584454) (← links)
- The lattice dimension of a graph (Q1775025) (← links)
- Graphs over graded rings and relation with Hamming graph (Q2049028) (← links)
- About some robustness and complexity properties of \(G\)-graphs networks (Q2255041) (← links)
- On the canonical metric representation, average distance, and partial Hamming graphs (Q2581459) (← links)
- (Q4581899) (← links)
- Factorization and pseudofactorization of weighted graphs (Q6162029) (← links)
