Planarity of the 2-level Cactus Model

Cornelsen, Sabine; Dinitz, Yefim; Wagner, Dorothea

Planarity of the 2-level Cactus Model

Files

preprint_142.pdf(290.93 KB)

Date

2001

Authors

Cornelsen, Sabine

Dinitz, Yefim

Wagner, Dorothea

Series

Konstanzer Schriften in Mathematik und Informatik; 142

Publication type

Preprint

Abstract

The 2-level cactus introduced by Dinitz and Nutov (1995) is a data structure that represents the minimum and minimum+1 edge-cuts of an undirected connected multi-graph G in a compact way. In this paper, we study planarity of the 2-level cactus, which can be used e.g. in graph drawing. We give a new sufficient planarity criterion in terms of projection paths over a spanning subtree of a graph. Using this criterion, we show that the 2-level cactus of G is planar if the cardinality of a minimum edge-cut of G is not equal to 2, 3 or 5. On the other hand, we give examples for non-planar 2-level cacti of graphs with these connectivities.

Subject (DDC)

004 Computer Science

Cite This

ISO 690

CORNELSEN, Sabine, Yefim DINITZ, Dorothea WAGNER, 2001. Planarity of the 2-level Cactus Model

BibTex

@unpublished{Cornelsen2001Plana-6111,
  year={2001},
  title={Planarity of the 2-level Cactus Model},
  author={Cornelsen, Sabine and Dinitz, Yefim and Wagner, Dorothea}
}

RDF

<rdf:RDF
    xmlns:dcterms="http://purl.org/dc/terms/"
    xmlns:dc="http://purl.org/dc/elements/1.1/"
    xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#"
    xmlns:bibo="http://purl.org/ontology/bibo/"
    xmlns:dspace="http://digital-repositories.org/ontologies/dspace/0.1.0#"
    xmlns:foaf="http://xmlns.com/foaf/0.1/"
    xmlns:void="http://rdfs.org/ns/void#"
    xmlns:xsd="http://www.w3.org/2001/XMLSchema#" > 
  <rdf:Description rdf:about="https://kops.uni-konstanz.de/server/rdf/resource/123456789/6111">
    <dcterms:hasPart rdf:resource="https://kops.uni-konstanz.de/bitstream/123456789/6111/1/preprint_142.pdf"/>
    <dcterms:abstract xml:lang="eng">The 2-level cactus introduced by Dinitz and Nutov (1995) is a data structure that represents the minimum and minimum+1 edge-cuts of an undirected connected multi-graph G in a compact way. In this paper, we study planarity of the 2-level cactus, which can be used e.g. in graph drawing. We give a new sufficient planarity criterion in terms of projection paths over a spanning subtree of a graph. Using this criterion, we show that the 2-level cactus of G is planar if the cardinality of a minimum edge-cut of G is not equal to 2, 3 or 5. On the other hand, we give examples for non-planar 2-level cacti of graphs with these connectivities.</dcterms:abstract>
    <dcterms:issued>2001</dcterms:issued>
    <dc:rights>terms-of-use</dc:rights>
    <bibo:uri rdf:resource="http://kops.uni-konstanz.de/handle/123456789/6111"/>
    <dc:format>application/pdf</dc:format>
    <dc:contributor>Wagner, Dorothea</dc:contributor>
    <dc:contributor>Cornelsen, Sabine</dc:contributor>
    <dcterms:available rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2011-03-24T16:09:36Z</dcterms:available>
    <dc:creator>Wagner, Dorothea</dc:creator>
    <dspace:hasBitstream rdf:resource="https://kops.uni-konstanz.de/bitstream/123456789/6111/1/preprint_142.pdf"/>
    <void:sparqlEndpoint rdf:resource="http://localhost/fuseki/dspace/sparql"/>
    <dc:creator>Cornelsen, Sabine</dc:creator>
    <dc:language>eng</dc:language>
    <dcterms:title>Planarity of the 2-level Cactus Model</dcterms:title>
    <dspace:isPartOfCollection rdf:resource="https://kops.uni-konstanz.de/server/rdf/resource/123456789/36"/>
    <foaf:homepage rdf:resource="http://localhost:8080/"/>
    <dc:contributor>Dinitz, Yefim</dc:contributor>
    <dcterms:rights rdf:resource="https://rightsstatements.org/page/InC/1.0/"/>
    <dc:creator>Dinitz, Yefim</dc:creator>
    <dcterms:isPartOf rdf:resource="https://kops.uni-konstanz.de/server/rdf/resource/123456789/36"/>
    <dc:date rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2011-03-24T16:09:36Z</dc:date>
  </rdf:Description>
</rdf:RDF>

Bibliography of Konstanz

No