Dominoes

DOI10.1007/3-540-59071-4_41MaRDI QIDQ6184362zbMATH OpenOpenAlexFDO

Authors Ton Kloks, Dieter Kratsch, Haiko Müller

Publication date 5 January 2024

Published in Graph-Theoretic Concepts in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-59071-4_41

zbMATH Keywords

linear time algorithmmaximal cliques

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Analysis of algorithms and problem complexity (68Q25) Structural characterization of families of graphs (05C75) Graph operations (line graphs, products, etc.) (05C76)

Recommendations

• On the problem of domino recognition
• Line Graphs of Helly Hypergraphs
• Domino Treewidth
• Domino treewidth
• Graphs obtained by disjoint unions and joins of cliques and stable sets

Cites work

• scientific article; zbMATH DE number 3859178 (Why is no real title available?)
• scientific article; zbMATH DE number 4065021 (Why is no real title available?)
• scientific article; zbMATH DE number 3677862 (Why is no real title available?)
• scientific article; zbMATH DE number 43754 (Why is no real title available?)
• scientific article; zbMATH DE number 566078 (Why is no real title available?)
• scientific article; zbMATH DE number 3286813 (Why is no real title available?)
• scientific article; zbMATH DE number 3290993 (Why is no real title available?)
• scientific article; zbMATH DE number 3102314 (Why is no real title available?)
• A \(max \{m, n \}\) algorithm for determining the graph H from its line graph G
• A labeling algorithm to recognize a line digraph and output its root graph
• Algebraic Graph Theory
• An Optimal Algorithm to Detect a Line Graph and Output Its Root Graph
• Arboricity and Subgraph Listing Algorithms
• Finding a Minimum Circuit in a Graph
• Graphe représentatif des arêtes d'un multigraphe
• Incidence matrices and interval graphs
• Kernels in perfect line-graphs
• Line graphs, root systems, and elliptic geometry
• Line perfect graphs
• Matching theory
• Min Cut is NP-complete for edge weighted trees
• On maximal independent sets of vertices in claw-free graphs
• On the pathwidth of chordal graphs

Cited in

(5)

• Domino Waves
• Domino treewidth
• Clumsy packing of dominoes
• Domino-tiling games
• Graphs obtained by disjoint unions and joins of cliques and stable sets

This page was built for publication: Dominoes

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