Forbidding and enforcing on graphs

DOI10.1016/j.tcs.2011.12.029zbMath1242.05228OpenAlexW2099391218MaRDI QIDQ418768

Daniela Genova, Nataša Jonoska

Publication date: 30 May 2012

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

Full work available at URL: https://doi.org/10.1016/j.tcs.2011.12.029

zbMATH Keywords

graphssubgraphs\(k\)-colorability\(k\)-regularfe-systemsforbidding enforcing

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Graph theory (including graph drawing) in computer science (68R10) Structural characterization of families of graphs (05C75)

Related Items (2)

Constraints for generating graphs with imposed and forbidden patterns: an application to molecular graphs ⋮ Finite language forbidding-enforcing systems

Cites Work

• Forbidden subgraphs and Hamiltonian properties and graphs
• Forbidding and enforcing in membrane computing
• Sequences of languages in forbidding-enforcing families
• Forbidding--enforcing systems
• Defining Languages by Forbidding-Enforcing Systems
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Forbidding and enforcing on graphs