Canonical antichains of unit interval and bipartite permutation graphs
From MaRDI portal
Publication:651422
DOI10.1007/S11083-010-9188-7zbMATH Open1234.05222OpenAlexW2023990208MaRDI QIDQ651422FDOQ651422
Authors: Vadim Lozin, Colin Mayhill 
Publication date: 13 December 2011
Published in: Order (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11083-010-9188-7
Recommendations
- Publication:4732482
- A class of bipartite and antipodal graphs and their uniform posets
- On canonical decomposition of bipartite graphs
- Antifactors of regular bipartite graphs
- On canonical antichains
- scientific article; zbMATH DE number 4183467
- scientific article; zbMATH DE number 4063148
- scientific article; zbMATH DE number 1896992
- Permutation bigraphs and interval containments
- Antitwins in partitionable graphs
Cites Work
- Graph minors. XX: Wagner's conjecture
- Optimal path cover problem on block graphs and bipartite permutation graphs
- Proper interval graphs and the guard problem
- Subgraphs and well‐quasi‐ordering
- Minimal classes of graphs of unbounded clique-width
- Bipartite permutation graphs
- Pathwidth, Bandwidth, and Completion Problems to Proper Interval Graphs with Small Cliques
- Induced subgraphs and well‐quasi‐ordering
- Ordering by Divisibility in Abstract Algebras
- Decompositions for the edge colouring of reduced indifference graphs.
- Title not available (Why is that?)
- Precoloring extension on unit interval graphs
- A Fully dynamic algorithm for recognizing and representing proper interval graphs
- A short proof that `proper = unit'
- Split graphs of Dilworth number 2
- SIMPLE MAX-CUT for unit interval graphs and graphs with few \(P4\)s
- Title not available (Why is that?)
- NP-completeness results for some problems on subclasses of bipartite and chordal graphs
- Letter graphs and well-quasi-order by induced subgraphs
- On canonical antichains
- Jump number maximization for proper interval graphs and series-parallel graphs
- Title not available (Why is that?)
- Stable sets versus independent sets
Cited In (10)
- Hereditary classes of ordered sets of width at most two
- Critical properties of bipartite permutation graphs
- Title not available (Why is that?)
- Labelled well-quasi-order for permutation classes
- Recent progress on well-quasi-ordering graphs
- Bichain graphs: geometric model and universal graphs
- Well-quasi-ordering and Embeddability of Relational Structures
- On canonical antichains
- Rationality for subclasses of 321-avoiding permutations
- Split permutation graphs
This page was built for publication: Canonical antichains of unit interval and bipartite permutation graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q651422)
