Dominoes
type: Item
instance of: scholarly article
title: Dominoes
zbMATH Open document ID: 1530.05158
DOI: 10.1007/3-540-59071-4_41
author: Ton Kloks
author: Dieter Kratsch
author: Haiko Müller
published in: Graph-Theoretic Concepts in Computer Science
publication date: 2024-01-05T00:00:00Z
Mathematics Subject Classification ID: 05C75
Mathematics Subject Classification ID: 05C85
Mathematics Subject Classification ID: 05C76
Mathematics Subject Classification ID: 68Q25
zbMATH DE Number: 7784119
zbMATH Keywords: maximal cliques
zbMATH Keywords: linear time algorithm
MaRDI profile type: Publication
full work available at URL: 3-540-59071-4 41
OpenAlex ID: W4245603936
cites work: Q5570136
cites work: Q3993087
cites work: Graphe représentatif des arêtes d'un multigraphe
cites work: Q4291429
cites work: Line graphs, root systems, and elliptic geometry
cites work: Q3798682
cites work: Arboricity and Subgraph Listing Algorithms
cites work: Algebraic Graph Theory
cites work: Q3874228
cites work: Incidence matrices and interval graphs
cites work: Q3328583
cites work: On the pathwidth of chordal graphs
cites work: Q5572939
cites work: Finding a Minimum Circuit in a Graph
cites work: Q5837982
cites work: An Optimal Algorithm to Detect a Line Graph and Output Its Root Graph
cites work: Matching theory
cites work: Kernels in perfect line-graphs
cites work: On maximal independent sets of vertices in claw-free graphs
cites work: Min Cut is NP-complete for edge weighted trees
cites work: A \(max \{m, n \}\) algorithm for determining the graph H from its line graph G
cites work: A labeling algorithm to recognize a line digraph and output its root graph
cites work: Line perfect graphs
description: scientific article; zbMATH DE number 7784119