On the bi-enhancement of chordal-bipartite probe graphs
From MaRDI portal
(Redirected from Publication:991750)
Recommendations
- Chordal probe graphs (extended abstract)
- On cycle- and bi-cycle extendability in chordal and chordal bipartite graphs
- Several results on chordal bipartite graphs
- Recognizing Chordal Probe Graphs and Cycle-Bicolorable Graphs
- Two characterizations of chain partitioned probe graphs
- A \(k\)-partite generalization of chordal bipartite graphs
- A characterization of chain probe graphs
- Chordal bipartite graphs of bounded tree- and clique-width
- Representation characterizations of chordal bipartite graphs
- Chordal bipartite, strongly chordal, and strongly chordal bipartite graphs
Cites work
- scientific article; zbMATH DE number 1735726 (Why is no real title available?)
- scientific article; zbMATH DE number 2117210 (Why is no real title available?)
- scientific article; zbMATH DE number 2119749 (Why is no real title available?)
- A characterization of chain probe graphs
- A note on finding all homogeneous set sandwiches
- A polynomial time recognition algorithm for probe interval graphs
- Chordal probe graphs
- Computing and Combinatorics
- Graph Sandwich Problems
- On probe interval graphs
- Perfect Elimination and Chordal Bipartite Graphs
- Probe threshold and probe trivially perfect graphs
- Recognizing Chordal Probe Graphs and Cycle-Bicolorable Graphs
- The complexity of comparability graph recognition and coloring
- The pair completion algorithm for the homogeneous set sandwich problem
Cited in
(5)
This page was built for publication: On the bi-enhancement of chordal-bipartite probe graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q991750)