Pathwidth of Circular-Arc Graphs (Q3508573)

From MaRDI portal

Jump to:navigation, search

scientific article

Language	Label	Description	Also known as
English	Pathwidth of Circular-Arc Graphs	scientific article

Statements

scholarly article

0 references

Pathwidth of Circular-Arc Graphs (English)

0 references

0 references

0 references

Graph-Theoretic Concepts in Computer Science

0 references

publication date

1 July 2008

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1007/978-3-540-74839-7_25

0 references

A partial k-arboretum of graphs with bounded treewidth

0 references

Approximation of pathwidth of outerplanar graphs

0 references

Efficient and Constructive Algorithms for the Pathwidth and Treewidth of Graphs

0 references

Computing the vertex separation of unicyclic graphs

0 references

The vertex separation and search number of a graph

0 references

A 3-approximation for the pathwidth of Halin graphs

0 references

0 references

Characterizing Minimal Interval Completions

0 references

TREEWIDTH OF CIRCLE GRAPHS

0 references

Minimum Fill-in on Circle and Circular-Arc Graphs

0 references

Linear-time recognition of circular-arc graphs

0 references

The complexity of searching a graph

0 references

Graph minors. I. Excluding a forest

0 references

Construction of linear tree-layouts which are optimal with respect to vertex separation in linear time

0 references

Sur deux propriétés des classes d'ensembles

0 references

Identifiers

zbMATH Open document ID

0 references

10.1007/978-3-540-74839-7_25

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

0 references

zbMATH DE Number

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:3508573

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