Result: Barycentric systems and stretchability

Title:
Barycentric systems and stretchability
Source:
Advances in graph drawing; The 11th International Symposium on Graph DrawingDiscrete applied mathematics. 155(9):1079-1095
Publisher Information:
Amsterdam; Lausanne; New York, NY: Elsevier, 2007.
Publication Year:
2007
Physical Description:
print, 11 ref
Original Material:
INIST-CNRS
Subject Terms:
Control theory, operational research, Automatique, recherche opérationnelle, Computer science, Informatique, Mathematics, Mathématiques, Sciences exactes et technologie, Exact sciences and technology, Sciences et techniques communes, Sciences and techniques of general use, Mathematiques, Mathematics, Combinatoire. Structures ordonnées, Combinatorics. Ordered structures, Combinatoire, Combinatorics, Plans d'expériences et configurations, Designs and configurations, Topologie. Variétés et complexes cellulaires. Analyse globale et analyse sur variétés, Topology. Manifolds and cell complexes. Global analysis and analysis on manifolds, Analyse globale, analyse sur des variétés, Global analysis, analysis on manifolds, Sciences appliquees, Applied sciences, Informatique; automatique theorique; systemes, Computer science; control theory; systems, Informatique théorique, Theoretical computing, Algorithmique. Calculabilité. Arithmétique ordinateur, Algorithmics. Computability. Computer arithmetics, Recherche information. Graphe, Information retrieval. Graph, Caractérisation, Characterization, Caracterización, Combinatoire, Combinatorics, Combinatoria, Etirage, Drawing, Estiramiento, Graphe planaire, Planar graph, Grafo planario, Informatique théorique, Computer theory, Informática teórica, Optimisation, Optimization, Optimización, Problème recouvrement, Covering problem, Problema recubrimiento, Résolution, Resolution, Sous graphe, Subgraph, Subgrafo, Sous système, Subsystem, Subsistema, 05B40, 37J55, 37Jxx, 68R10, 5C10;57M15, Stretchable pseudo-segments contact systems; Contact representation; Barycentric systems
Document Type:
Conference Conference Paper
File Description:
text
Language:
English
Author Affiliations:
Centre d'Analyse et de Mathématique Sociales, CNRS UMR 8557, École des Hautes Études en Sciences Sociales, 54 Boulevard Raspail, 75006 Paris, France
ISSN:
0166-218X
Rights:
Copyright 2008 INIST-CNRS
CC BY 4.0
Sauf mention contraire ci-dessus, le contenu de cette notice bibliographique peut être utilisé dans le cadre d’une licence CC BY 4.0 Inist-CNRS / Unless otherwise stated above, the content of this bibliographic record may be used under a CC BY 4.0 licence by Inist-CNRS / A menos que se haya señalado antes, el contenido de este registro bibliográfico puede ser utilizado al amparo de una licencia CC BY 4.0 Inist-CNRS
Notes:
Computer science; theoretical automation; systems

Mathematics
Accession Number:
edscal.18788143
Database:
PASCAL Archive

Further Information

Using a general resolution of barycentric systems we give a generalization of Tutte's theorem on convex drawing of planar graphs. We deduce a characterization of the edge coverings into pairwise non-crossing paths which are stretchable: such a system is stretchable if and only if each subsystem of at least two paths has at least three free vertices (vertices of the outer face of the induced subgraph which are internal to none of the paths of the subsystem). We also deduce that a contact system of pseudo-segments is stretchable if and only if it is extendible.