Bipartite permutation graphs
From MaRDI portal
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 bigraphs and interval containments
- Weighted efficient domination problem on some perfect graphs
- Chordal bipartite graphs of bounded tree- and clique-width
- Perspectives of Monge properties in optimization
- The NP-completeness of Steiner tree and dominating set for chordal bipartite graphs
- A polynomial time algorithm for longest paths in biconvex graphs
- Bipartite-perfect graphs
- Bipartite-perfect graphs
- Efficient parallel algorithms for doubly convex-bipartite graphs
- On the strong chromatic index and maximum induced matching of tree-cographs, permutation graphs and chordal bipartite graphs
- Efficient parallel recognition of some circular arc graphs. II
- Upper Clique Transversals in Graphs
- On permutations avoiding partially ordered patterns defined by bipartite graphs
- Succinct permutation graphs
- Canonical antichains of unit interval and bipartite permutation graphs
- Characterizations and recognition of circular-arc graphs and subclasses: a survey
- On the complexity of the maximum biplanar subgraph problem
- Optimal computation of shortest paths on doubly convex bipartite graphs
- Minimum Distortion Embeddings into a Path of Bipartite Permutation and Threshold Graphs
- An attractive class of bipartite graphs
- The Maximum Binary Tree Problem.
- Identification, location-domination and metric dimension on interval and permutation graphs. I: Bounds.
- Random Generation and Enumeration of Bipartite Permutation Graphs
- scientific article; zbMATH DE number 4063153 (Why is no real title available?)
- Computing the cutwidth of bipartite permutation graphs in linear time
- A new lower bound for the bipartite crossing number with applications
- Characterization of \(\mathrm{B}_0\)-VPG cocomparability graphs and a 2D visualization of their posets
- Permutation-exchange graphs that emulate the binary cube
- On bipartite powers of bigraphs
- Identification, location-domination and metric dimension on interval and permutation graphs. II: Algorithms and complexity
- Crossing Layout in Non-planar Graph Drawings
- scientific article; zbMATH DE number 2191997 (Why is no real title available?)
- A dichotomy for minimum cost graph homomorphisms
- Recognition and combinatorial optimization algorithms for bipartite chain graphs
- On the recognition of permuted bottleneck Monge matrices
- Circularly compatible ones, \(D\)-circularity, and proper circular-arc bigraphs
- On the \(k\)-path partition of graphs.
- Complexity of Hamiltonian cycle reconfiguration
- Interval \(k\)-graphs and orders
- Partitioning graphs into Hamiltonian ones
- scientific article; zbMATH DE number 3919840 (Why is no real title available?)
- Algorithms for maximum internal spanning tree problem for some graph classes
- A polynomial kernel for bipartite permutation vertex deletion
- Coloring a dominating set without conflicts: \(q\)-subset square coloring
- Vertex ordering with precedence constraints
- Impact of diameter and convex ordering for Hamiltonicity and domination
- Edge domination on bipartite permutation graphs and cotriangulated graphs
- Visibility graphs of towers
- Cyclability in graph classes
- Permuting matrices to avoid forbidden submatrices
- 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
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)
