The bipartite edge frustration of hierarchical product of graphs
From MaRDI portal
(Redirected from Publication:277458)
Recommendations
- Study of the bipartite edge frustration of graphs
- Computing the bipartite edge frustration of fullerene graphs
- The bipartite edge frustration of graphs under subdivided edges and their related sums
- The bipartite edge frustration of composite graphs
- The bipartite edge frustration of extension of splice and link graphs
Cites work
- scientific article; zbMATH DE number 194437 (Why is no real title available?)
- scientific article; zbMATH DE number 854567 (Why is no real title available?)
- Computing the bipartite edge frustration of fullerene graphs
- On some extremal problems in graph theory
- The bipartite edge frustration of composite graphs
- The bipartite edge frustration of extension of splice and link graphs
- The generalized hierarchical product of graphs
- The hierarchical product of graphs
Cited in
(8)- Computing the bipartite edge frustration of fullerene graphs
- Bipartite edge frustration and maximum independent set problems on fulleroids-\((3,4,6)\)
- The bipartite edge frustration of extension of splice and link graphs
- The bipartite edge frustration of composite graphs
- Study of the bipartite edge frustration of graphs
- Extremal properties of the bipartite vertex frustration of graphs
- The bipartite edge frustration of graphs under subdivided edges and their related sums
- On the bipartite vertex frustration of graphs
This page was built for publication: The bipartite edge frustration of hierarchical product of graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q277458)