Homomorphieeigenschaften und mittlere Kantendichte von Graphen

1967/12/01 by W. Mader · 8 citations
Computer Science · Mathematics · #Advanced Graph Theory Research #Graph Labeling and Dimension Problems #Graph theory and applications #Mathematics

paper · doi:10.1007/bf01364272

crossref issued 1967/12/01 · crossref published 1967/12/01 · crossref published-print 1967/12/01 · openalex publication_date 1967/12/01 · crossref created 2005/03/27 · crossref deposited 2019/05/02 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/23 · crossref indexed 2026/07/28

Cited by

• Complexity of Grundy Coloring and Its Variants
• Truthful Mechanism Design for Multidimensional Covering Problems
• Homomorphies�tze f�r Graphen
• All maximal independent sets and dynamic dominance for sparse graphs
• High-Girth Graphs Avoiding a Minor are Nearly Bipartite
• Subdivisions of maximal 3‐degenerate graphs of order d+1 d+1 in graphs of minimum degree d d
• Separator Theorems for Minor-Free and Shallow Minor-Free Graphs with\n Applications
• Graph minor [wikipedia]