On the problem of domino recognition

DOI10.1016/J.ENDM.2006.06.029MaRDI QIDQ3439447zbMATH OpenOpenAlexFDO

Authors Y. V. Krylou, A. J. Perez Tchernov

Publication date 29 May 2007

Published in Electronic Notes in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.endm.2006.06.029

zbMATH Keywords

algorithmclique coveringdomino recognitionlinear domino recognition

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Recommendations

• Linear algorithm for domatic number problem on interval graphs
• The domatic number problem on some perfect graph families
• Holes and dominoes in Meyniel graphs
• Dominating cliques in graphs
• scientific article; zbMATH DE number 3974289

Cites work

• scientific article; zbMATH DE number 5819883 (Why is no real title available?)
• scientific article; zbMATH DE number 3400923 (Why is no real title available?)
• Hereditary properties of graphs: Asymptotic enumeration, global structure, and colouring
• On line graphs of linear 3-uniform hypergraphs
• On the entropy values of hereditary classes of graphs

Cited in

(6)

• Graphs as \(r\)-minoes
• Dominoes
• Domino Problem Under Horizontal Constraints
• Graphs obtained by disjoint unions and joins of cliques and stable sets
• Partial characterizations of circle graphs
• Line Graphs of Helly Hypergraphs

This page was built for publication: On the problem of domino recognition

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