S-functions for graphs

1976/03/01 by R. Halin, Rudolf Halin · 13 citations
Computer Science · Engineering · Mathematics · #Advanced Algebra and Logic #Class (philosophy) #Combinatorics #Discrete mathematics #Graph #Graph Labeling and Dimension Problems #Homomorphism #Mathematics #Natural number #Vertex (graph theory) #graph theory and CDMA systems

paper · doi:10.1007/bf01917434

crossref issued 1976/03/01 · crossref published 1976/03/01 · crossref published-print 1976/03/01 · openalex publication_date 1976/03/01 · crossref created 2005/07/30 · crossref deposited 2019/05/10 · openalex created_date 2025/10/10 · crossref indexed 2026/07/01 · openalex updated_date 2026/07/29

Citations

• Über eine Eigenschaft der ebenen Komplexe

Cited by

• An Improvement of Reed’s Treewidth Approximation
• Grad and classes with bounded expansion II. Algorithmic aspects
• Directed Tree-Width
• Simultaneous separation in bounded degree trees
• LP approximations to mixed-integer polynomial optimization problems
• Kernelization: Theory of Parameterized Preprocessing
• Descriptive and Parameterized Complexity
• Layout of Graphs with Bounded Tree-Width
• The Behavior of Clique-Width under Graph Operations and Graph Transformations
• MSOL-Definability Equals Recognizability for Halin Graphs and Bounded Degree k-Outerplanar Graphs
• Hadwiger number [wikipedia]
• Tree decomposition [wikipedia]
• Treewidth [wikipedia]