Recommendations
Cites work
- scientific article; zbMATH DE number 3859178 (Why is no real title available?)
- scientific article; zbMATH DE number 3900817 (Why is no real title available?)
- scientific article; zbMATH DE number 3943870 (Why is no real title available?)
- scientific article; zbMATH DE number 3694608 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 3310759 (Why is no real title available?)
- A Characterization of Comparability Graphs and of Interval Graphs
- A linear time algorithm to find the jump number of 2-dimensional bipartite partial orders
- An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs
- Computing the Minimum Fill-In is NP-Complete
- Domination in permutation graphs
- Finding minimum dominating cycles in permutation graphs
- Graph theory
- Hamilton Paths in Grid Graphs
- On Comparability and Permutation Graphs
- On testing isomorphism of permutation graphs
- Permutation Graphs and Transitive Graphs
- Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms
- The NP-completeness column: An ongoing guide
- The NP-completeness column: An ongoing guide
- The NP-completeness column: an ongoing guide
- The complexity of comparability graph recognition and coloring
- Transitiv orientierbare Graphen
- Transitive Orientation of Graphs and Identification of Permutation Graphs
- Triangulated graphs and the elimination process
Cited in
(only showing first 100 items - show all)- Permutation graphs and the weak Bruhat order
- Biclique graphs of interval bigraphs
- Mutual placement of bipartite graphs
- Core and Conditional Core Path of Specified Length in Special Classes of Graphs
- Acyclic domination on bipartite permutation graphs
- Vertex deletion into bipartite permutation graphs
- NP-completeness results for some problems on subclasses of bipartite and chordal graphs
- The multicolored graph realization problem
- How to use the minimal separators of a graph for its chordal triangulation
- Random generation and enumeration of bipartite permutation graphs
- Switch-based Markov chains for sampling Hamiltonian cycles in dense graphs
- Biclique graph of bipartite permutation graphs
- The k-way vertex cut problem on bipartite graphs: complexity results and algorithms
- Linear structure of bipartite permutation graphs and the longest path problem
- Computing minimum distortion embeddings into a path for bipartite permutation graphs and threshold graphs
- The weighted maximum independent set problem in permutation graphs
- The maximum binary tree problem
- Bipartite Permutation Graphs Are Reconstructible
- Graphs and digraphs represented by intervals and circular arcs
- Contiguity orders
- \(L(2, 1)\)-labeling of permutation and bipartite permutation graphs
- Graph classes and the switch Markov chain for matchings
- Critical properties of bipartite permutation graphs
- On opposition graphs, coalition graphs, and bipartite permutation graphs
- Coloring permutation graphs in parallel
- Bandwidth of bipartite permutation graphs in polynomial time
- Minimal classes of graphs of unbounded clique-width
- Domination and packing in graphs
- Counting perfect matchings and the switch chain
- Labeling bipartite permutation graphs with a condition at distance two
- The rook problem on saw-toothed chessboards
- Algorithm and hardness results on hop domination in graphs
- Vertex-edge domination in interval and bipartite permutation graphs
- A faster fixed parameter algorithm for two-layer crossing minimization
- Spanning caterpillar in biconvex bipartite graphs
- Hybridizing simulated annealing with variable neighborhood search for bipartite graph crossing minimization
- scientific article; zbMATH DE number 2076924 (Why is no real title available?)
- Graph classes and forbidden patterns on three vertices
- Bibliography on domination in graphs and some basic definitions of domination parameters
- Recognizing interval digraphs and interval bigraphs in polynomial time
- Rainbow vertex coloring bipartite graphs and chordal graphs
- Linear-time recognition of double-threshold graphs
- On orthogonal ray graphs
- Optimal path cover problem on block graphs and bipartite permutation graphs
- Graph isomorphism and identification matrices: Sequential algorithms
- Finding a maximum independent set in a permutation graph
- Non-edge orientation and vertex ordering characterizations of some classes of bigraphs
- Bandwidth of convex bipartite graphs and related graphs
- A polynomial-time algorithm for finding critical nodes in bipartite permutation graphs
- A linear edge kernel for two-layer crossing minimization
- Clustering bipartite and chordal graphs: Complexity, sequential and parallel algorithms
- Path eccentricity of graphs
- Minimum cost homomorphisms with constrained costs
- L(2,1)-labeling of perfect elimination bipartite graphs
- On list \(k\)-coloring convex bipartite graphs
- Generate all maximal independent sets in permutation graphs
- Posets and VPG graphs
- On factorial properties of chordal bipartite graphs
- Parikh word representability of bipartite permutation graphs
- Acyclic matchings in subclasses of bipartite graphs
- On computing longest paths in small graph classes
- Efficient parallel algorithms for bipartite permutation graphs
- Solving the shortest-paths problem on bipartite permutation graphs efficiently
- Stick graphs with length constraints
- Labelled well-quasi-order for permutation classes
- Intersection models and forbidden pattern characterizations for 2-thin and proper 2-thin graphs
- On the OBDD representation of some graph classes
- Recognizing interval bigraphs by forbidden patterns
- On domination problems for permutation and other graphs
- Line directionality of orders
- Bipartite Analogues of Comparability and Cocomparability Graphs
- Letter graphs and geometric grid classes of permutations: characterization and recognition
- Characterization and a 2D Visualization of B$$_{0}$$-VPG Cocomparability Graphs
- On edge perfectness and classes of bipartite graphs
- Parallel algorithms for permutation graphs
- Uniquely restricted matchings in interval graphs
- Bipartite permutation graphs with application to the minimum buffer size problem
- Boundedness for proper conflict-free and odd colorings
- A new approach for the domination problem on permutation graphs
- Algorithms for maximum matching and minimum fill-in on chordal bipartite graphs
- HAMILTONian circuits in chordal bipartite graphs
- Double-threshold permutation graphs
- Vertex deletion into bipartite permutation graphs
- L(0,1)-labelling of permutation graphs
- Induced matchings in asteroidal triple-free graphs
- Acyclically pushable bipartite permutation digraphs: an algorithm
- Triangulating multitolerance graphs
- On the approximability of average completion time scheduling under precedence constraints.
- A theorem on permutation graphs with applications
- Colouring a dominating set without conflicts: \(q\)-subset square colouring
- Biconvex graphs: Ordering and algorithms
- Induced subgraph isomorphism on proper interval and bipartite permutation graphs
- A closer look at Hamiltonicity and domination through the lens of diameter and convexity
- On bipartite crossings, largest biplanar subgraphs, and the linear arrangement problem
- Bandwidth of Bipartite Permutation Graphs in Polynomial Time
- Alternating sign matrices, related (0,1)-matrices, and the Smith normal form
- Linear-time algorithms for counting independent sets in bipartite permutation graphs
- Quasimonotone graphs
- Ferrers dimension of grid intersection graphs
- Solving the weighted efficient edge domination problem on bipartite permutation graphs
This page was built for publication: Bipartite permutation graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1092931)
