New classes of extremal graphs with given bandwidth
From MaRDI portal
(Redirected from Publication:489353)
Recommendations
- An extremal graph with given bandwidth
- An extremal bandwidth problem for bipartite graphs
- scientific article; zbMATH DE number 1161305
- scientific article; zbMATH DE number 3859182
- Some new results in extremal graph theory
- Bounding the bandwidths for graphs
- On extremal graphs with bounded girth
- New graph classes of bounded clique-width
- scientific article; zbMATH DE number 1953082
- scientific article; zbMATH DE number 3732090
Cites work
- scientific article; zbMATH DE number 89768 (Why is no real title available?)
- scientific article; zbMATH DE number 1179517 (Why is no real title available?)
- scientific article; zbMATH DE number 1455585 (Why is no real title available?)
- scientific article; zbMATH DE number 1778090 (Why is no real title available?)
- scientific article; zbMATH DE number 812088 (Why is no real title available?)
- scientific article; zbMATH DE number 3232670 (Why is no real title available?)
- A survey of solved problems and applications on bandwidth, edgesum, and profile of graphs
- An extremal graph with given bandwidth
- Graphs without four-cycles
- On the number of edges of quadrilateral-free graphs
- On the size of graphs of a given bandwidth
- The bandwidth problem for graphs and matrices—a survey
Cited in
(2)
This page was built for publication: New classes of extremal graphs with given bandwidth
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q489353)
