Entity usage
From MaRDI portal
This page lists pages that use the given entity (e.g. Q42). The list is sorted by descending page ID, so that newer pages are listed first.
Showing below up to 21 results in range #1 to #21.
- Tree Projections: Game Characterization and Computational Aspects: Label: en
- Recognition of Antimatroidal Point Sets: Label: en
- Properly Coloured Cycles and Paths: Results and Open Problems: Label: en
- Path Partitions, Cycle Covers and Integer Decomposition: Label: en
- Path-Bicolorable Graphs: Label: en
- O(m logn) Split Decomposition of Strongly Connected Graphs: Label: en
- On the Cubicity of AT-Free Graphs and Circular-Arc Graphs: Label: en
- On Related Edges in Well-Covered Graphs without Cycles of Length 4 and 6: Label: en
- On Path Partitions and Colourings in Digraphs: Label: en
- On Duality between Local Maximum Stable Sets of a Graph and Its Line-Graph: Label: en
- On Distance-3 Matchings and Induced Matchings: Label: en
- Local Search Heuristics for the Multidimensional Assignment Problem: Label: en
- HyperConsistency Width for Constraint Satisfaction: Algorithms and Complexity Results: Label: en
- Dominating Induced Matchings: Label: en
- Covering a Tree by a Forest: Label: en
- Combinatorial Problems for Horn Clauses: Label: en
- Asynchronous Congestion Games: Label: en
- A Note on the Recognition of Nested Graphs: Label: en
- Algorithms on Subtree Filament Graphs: Label: en
- A Higher-Order Graph Calculus for Autonomic Computing: Label: en
- Landmarks in Algorithmic Graph Theory: A Personal Retrospective: Label: en
