Dominoes
DOI10.1007/3-540-59071-4_41zbMATH Open1530.05158OpenAlexW4245603936MaRDI QIDQ6184362FDOQ6184362
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
Recommendations
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)
Cites Work
- Matching theory
- Title not available (Why is that?)
- Algebraic Graph Theory
- Min Cut is NP-complete for edge weighted trees
- A \(max \{m, n \}\) algorithm for determining the graph H from its line graph G
- Incidence matrices and interval graphs
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Kernels in perfect line-graphs
- On maximal independent sets of vertices in claw-free graphs
- Title not available (Why is that?)
- Graphe représentatif des arêtes d'un multigraphe
- Title not available (Why is that?)
- On the pathwidth of chordal graphs
- Arboricity and Subgraph Listing Algorithms
- Finding a Minimum Circuit in a Graph
- An Optimal Algorithm to Detect a Line Graph and Output Its Root Graph
- Line graphs, root systems, and elliptic geometry
- Line perfect graphs
- A labeling algorithm to recognize a line digraph and output its root graph
- Title not available (Why is that?)
Cited In (5)
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)
