Edge-maximal graphs with cutwidth at most three

DOI10.7151/DMGT.2395MaRDI QIDQ6985992zbMATH OpenFDO

Authors Zhenkun Zhang

Publication date 12 May 2025

Published in Discussiones Mathematicae. Graph Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.7151/DMGT.2395

zbMATH Keywords

combinatoricscutwidthedge-maximal graphgraph labeling

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Structural characterization of families of graphs (05C75) Graph labelling (graceful graphs, bandwidth, etc.) (05C78) Combinatorial optimization (90C27)

Cites work

• A polynomial algorithm for the min-cut linear arrangement of trees
• Characterizations of \(k\)-cutwidth critical trees
• Cutwidth II: Algorithms for partial w-trees of bounded degree
• Cutwidth of iterated caterpillars
• Cutwidth of the r-dimensional mesh of d-ary trees
• Decompositions of critical trees with cutwidth k
• Graph theory
• Graphs with small bandwidth and cutwidth
• scientific article; zbMATH DE number 4070955 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 857606 (Why is no real title available?)
• On 3-cutwidth critical graphs
• On 4-cutwidth critical trees.
• Polynomial Time Algorithms for the MIN CUT Problem on Degree Restricted Trees
• Topological Bandwidth
• Tree-width, path-width, and cutwidth

This page was built for publication: Edge-maximal graphs with cutwidth at most three

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6985992)