On minimal graphs

DOI10.1016/0304-3975(82)90135-9MaRDI QIDQ1158767zbMATH OpenOpenAlexWikidataFDO

Authors 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)

Cites work

• scientific article; zbMATH DE number 3685495 (Why is no real title available?)
• Color-families are dense
• Colorings and interpretations: a connection between graphs and grammar forms
• Context-free grammar forms with strict interpretations
• Grammar and L forms: an introduction
• Parallel concepts in graph theory

Cited in

(8)

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

This page was built for publication: On minimal graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1158767)