Characterizing Graphs of Small Carving-Width

DOI10.1007/978-3-642-31770-5_32MaRDI QIDQ3167377zbMATH OpenOpenAlexFDO

Authors Rémy Belmonte, Pim Van 't Hof, Marcin Kamiński, Daniël Paulusma, Dimitrios M. Thilikos

Publication date 2 November 2012

Published in Combinatorial Optimization and Applications (Search for Journal in Brave)

Full work available at URL http://dro.dur.ac.uk/14119/1/14119.pdf

Mathematics Subject Classification ID

Trees (05C05) Graph algorithms (graph-theoretic aspects) (05C85) Distance in graphs (05C12) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Recommendations

• Characterizing graphs of small carving-width
• Graphs with small bandwidth and cutwidth
• Graphs of small dimensions
• scientific article; zbMATH DE number 951844
• Spectral characterizations of graphs with small spectral radius
• Characterizing graphs of maximum matching width at most 2
• Characterization of graphs and digraphs with small process numbers
• scientific article; zbMATH DE number 3906545
• Treewidth for graphs with small chordality
• Embedding graphs of small size

Cited in

(3)

• The carving-width of generalized hypercubes
• Characterizing graphs of small carving-width
• The carvingwidth of hypercubes

This page was built for publication: Characterizing Graphs of Small Carving-Width

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