The treewidth and pathwidth of hypercubes (Q819827)

From MaRDI portal

Revision as of 09:58, 9 December 2024 by Import241208021249 (talk | contribs) (Normalize DOI.)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Jump to:navigation, search

scientific article

Language	Label	Description	Also known as
English	The treewidth and pathwidth of hypercubes	scientific article

Statements

scholarly article

0 references

The treewidth and pathwidth of hypercubes (English)

0 references

L. Sunil Chandran

0 references

Telikepalli Kavitha

0 references

Discrete Mathematics

0 references

publication date

29 March 2006

0 references

zbMATH Keywords

Hamming graph

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1016/j.disc.2005.12.011

0 references

A partial k-arboretum of graphs with bounded treewidth

0 references

0 references

A short proof for a theorem of Harper about Hamming-spheres

0 references

0 references

Optimal numberings and isoperimetric problems on graphs

0 references

On an isoperimetric problem for Hamming graphs

0 references

0 references

Graph minors. II. Algorithmic aspects of tree-width

0 references

Graph minors. I. Excluding a forest

0 references

Identifiers

zbMATH Open document ID

0 references

Mathematics Subject Classification ID

0 references

zbMATH DE Number

0 references

0 references

10.1016/J.DISC.2005.12.011

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:819827

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q819827&oldid=38244006"