Completely Connected Clustered Graphs

Cite This

Files in this item

Files Size Format View

There are no files associated with this item.

CORNELSEN, Sabine, Dorothea WAGNER, 2003. Completely Connected Clustered Graphs. Graph-Theoretic Concepts in Computer Science : 29th International Workshop, WG 2003. Elspeet, The Netherlands, Jun 19, 2003 - Jun 21, 2003. In: BODLAENDER, Hans L., ed.. Graph-Theoretic Concepts in Computer Science : 29th International Workshop, WG 2003, Revised Papers. Berlin:Springer, pp. 168-179. ISSN 0302-9743. eISSN 1611-3349. ISBN 978-3-540-20452-7. Available under: doi: 10.1007/978-3-540-39890-5_15

@inproceedings{Cornelsen2003Compl-44801, title={Completely Connected Clustered Graphs}, year={2003}, doi={10.1007/978-3-540-39890-5_15}, number={2880}, isbn={978-3-540-20452-7}, issn={0302-9743}, address={Berlin}, publisher={Springer}, series={Lecture Notes in Computer Science}, booktitle={Graph-Theoretic Concepts in Computer Science : 29th International Workshop, WG 2003, Revised Papers}, pages={168--179}, editor={Bodlaender, Hans L.}, author={Cornelsen, Sabine and Wagner, Dorothea} }

<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/rdf/resource/123456789/44801"> <dc:date rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2019-02-01T13:02:47Z</dc:date> <dcterms:title>Completely Connected Clustered Graphs</dcterms:title> <bibo:uri rdf:resource="https://kops.uni-konstanz.de/handle/123456789/44801"/> <foaf:homepage rdf:resource="http://localhost:8080/jspui"/> <dcterms:isPartOf rdf:resource="https://kops.uni-konstanz.de/rdf/resource/123456789/36"/> <dc:contributor>Wagner, Dorothea</dc:contributor> <dspace:isPartOfCollection rdf:resource="https://kops.uni-konstanz.de/rdf/resource/123456789/36"/> <dcterms:abstract xml:lang="eng">Planar drawings of clustered graphs are considered. We introduce the notion of completely connected clustered graphs, i.e. hierarchically clustered graphs that have the property that not only every cluster but also each complement of a cluster induces a connected subgraph. As a main result, we prove that a completely connected clustered graph is c-planar if and only if the underlying graph is planar. Further, we investigate the influence of the root of the inclusion tree to the choice of the outer face of the underlying graph and vice versa.</dcterms:abstract> <dcterms:available rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2019-02-01T13:02:47Z</dcterms:available> <dc:contributor>Cornelsen, Sabine</dc:contributor> <void:sparqlEndpoint rdf:resource="http://localhost/fuseki/dspace/sparql"/> <dcterms:issued>2003</dcterms:issued> <dc:creator>Cornelsen, Sabine</dc:creator> <dc:language>eng</dc:language> <dc:creator>Wagner, Dorothea</dc:creator> </rdf:Description> </rdf:RDF>

This item appears in the following Collection(s)

Search KOPS


Browse

My Account