On minimal graphs

DOI10.1016/0304-3975(82)90135-9zbMath0473.68063OpenAlexW2052423274WikidataQ59046314 ScholiaQ59046314MaRDI QIDQ1158767

W. D. Fellner

Publication date: 1982

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0304-3975(82)90135-9

zbMATH Keywords

coloring of graphsgrammar formsgraph interpretations

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Graph theory (including graph drawing) in computer science (68R10) Coloring of graphs and hypergraphs (05C15)

Related Items

Oriented incidence colourings of digraphs, On the complexity of H-coloring, Homomorphically full graphs, The core of a graph, The good, the bad, and the great: homomorphisms and cores of random graphs, Hereditarily hard \(H\)-colouring problems, Core-like properties of infinite graphs and structures, Symmetric graphs and interpretations

Cites Work

• Unnamed Item
• Grammar and L forms: an introduction
• Context-free grammar forms with strict interpretations
• Colorings and interpretations: a connection between graphs and grammar forms
• Color-families are dense
• Parallel concepts in graph theory