The total vertex separation number and profile of a graph

DOI10.1515/DMA.1998.8.1.73MaRDI QIDQ4522798zbMATH OpenOpenAlexFDO

Authors Petr A. Golovach, Fedor V. Fomin

Publication date 2 August 2001

Published in Discrete Mathematics and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1515/dma.1998.8.1.73

zbMATH Keywords

profilegraph invariantsenumerationstotal vertex separation number

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Enumeration in graph theory (05C30)

Recommendations

• The total vertex separation number of a graph
• Invariants of graphs defined through optimal numbering of vertices and the operation of joining graphs
• The cutwidth of a graph and the vertex separation number of the line graph
• scientific article; zbMATH DE number 638688
• The vertex separation number of a graph equals its path-width

Cited in

(6)

• Invariants of graphs defined through optimal numbering of vertices and the operation of joining graphs
• Searching expenditure and interval graphs
• Algorithms and bounds for L-drawings of directed graphs
• The total vertex separation number of a graph
• The vertex separation number of a graph equals its path-width
• Memory management optimization problems for integrated circuit simulators

This page was built for publication: The total vertex separation number and profile of a graph

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