Combinatorics and algorithms for quasi-chain graphs
From MaRDI portal
Publication:5925628
DOI10.1007/s00453-022-01019-6OpenAlexW3155023502MaRDI QIDQ5925628
Dmitriy S. Malyshev, Bogdan Alecu, Vadim V. Lozin, Aistis Atminas
Publication date: 9 March 2023
Published in: Algorithmica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00453-022-01019-6
Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85)
Cites Work
- Unnamed Item
- Pattern matching for permutations
- Implicit representations and factorial properties of graphs
- Induced subgraph isomorphism on proper interval and bipartite permutation graphs
- Patterns in permutations and words.
- On partial well-order for monotone grid classes of permutations
- Graph minors. XX: Wagner's conjecture
- Satgraphs and independent domination. I
- Domination in convex and chordal bipartite graphs
- The NP-completeness of Steiner tree and dominating set for chordal bipartite graphs
- Alternating cycle-free matchings
- Letter graphs and well-quasi-order by induced subgraphs
- The maximum edge biclique problem is NP-complete
- On maximum induced matchings in bipartite graphs
- The speed of hereditary properties of graphs
- Algorithmic graph theory and perfect graphs
- HAMILTONian circuits in chordal bipartite graphs
- Bounds for graph regularity and removal lemmas
- An infinite antichain of permutations
- Two forbidden induced subgraphs and well-quasi-ordering
- Perfect dominating sets in the Cartesian products of prime cycles
- Bipartite induced subgraphs and well-quasi-ordering
- THE CLIQUE-WIDTH OF BIPARTITE GRAPHS IN MONOGENIC CLASSES
- Forbidden induced bipartite graphs
- Implicat Representation of Graphs
- Characterizing and decomposing classes of threshold, split, and bipartite graphs via 1‐Sperner hypergraphs
- Regularity lemmas for stable graphs
- Induced subgraphs and well‐quasi‐ordering
- Ordering by Divisibility in Abstract Algebras
- Difference graphs
- The NP-completeness column: An ongoing guide
- Combinatorics and algorithms for quasi-chain graphs
This page was built for publication: Combinatorics and algorithms for quasi-chain graphs
