On a code problem concerning planar acyclic graphs

DOI10.1051/ITA/1991250302051MaRDI QIDQ3350765zbMATHOpenAlexFDO

Authors Francis Bossut, Bruno Warin

Publication date 1991

Published in RAIRO - Theoretical Informatics and Applications (Search for Journal in Brave)

Full work available at URL https://eudml.org/doc/92389

zbMATH Keywords

unsolvabilitycode problemconnected planardirected ordered acyclic graphs

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• Codes on planar Tanner graphs
• scientific article; zbMATH DE number 4070305
• Identifying codes in trees and planar graphs
• Discriminating codes in (bipartite) planar graphs
• On graphs and codes
• scientific article; zbMATH DE number 3298614
• A note on acyclic number of planar graphs
• Codes on graphs: Recent progress
• An application of coding theory to a problem in graphical enumeration

Cites work

• scientific article; zbMATH DE number 3692668 (Why is no real title available?)
• scientific article; zbMATH DE number 3607504 (Why is no real title available?)
• scientific article; zbMATH DE number 475410 (Why is no real title available?)
• scientific article; zbMATH DE number 3251427 (Why is no real title available?)
• scientific article; zbMATH DE number 3311755 (Why is no real title available?)
• Parallel and two-way automata on directed ordered acyclic graphs
• The parsing for general phrase-structure grammars
• Transformational classes of grammars

Cited in

(3)

• Planar Convex Codes are Decidable
• Complexity results for identifying codes in planar graphs
• Discriminating codes in (bipartite) planar graphs

This page was built for publication: On a code problem concerning planar acyclic graphs

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