On 4-cutwidth critical trees.

MaRDI QIDQ4924887zbMATH OpenFDO

Authors Yanpei Liu, Zhenkun Zhang

Publication date 10 June 2013

zbMATH Keywords

critical treecutwidthgraph labeling

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Extremal problems in graph theory (05C35) Paths and cycles (05C38)

Recommendations

• Characterizations of \(k\)-cutwidth critical trees
• On 3-cutwidth critical graphs
• Decompositions of critical trees with cutwidth k
• Decomposability of a class of \(k\)-cutwidth critical graphs
• scientific article; zbMATH DE number 1854105

Cited in

(9)

• On 3-cutwidth critical graphs
• The cutwidth of trees with diameters at most 4
• Decomposability of a class of \(k\)-cutwidth critical graphs
• Decompositions of critical trees with cutwidth k
• Characterizations of \(k\)-cutwidth critical trees
• scientific article; zbMATH DE number 1854105 (Why is no real title available?)
• Cutwidth of iterated caterpillars
• A degree sequence method for the cutwidth problem of graphs
• Edge-maximal graphs with cutwidth at most three

This page was built for publication: On 4-cutwidth critical trees.

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