On the bi-enhancement of chordal-bipartite probe graphs

DOI10.1016/j.ipl.2009.12.003zbMath1197.05123OpenAlexW2148209458MaRDI QIDQ991750

Martin Charles Golumbic, Michal Stern, Elad Cohen, Marina Lipshteyn

Publication date: 7 September 2010

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2009.12.003

zbMATH Keywords

combinatorial problemschordal bipartite graphsprobe graphs

Mathematics Subject Classification ID

Structural characterization of families of graphs (05C75) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items (3)

Good characterizations and linear time recognition for 2-probe block graphs ⋮ Two characterizations of chain partitioned probe graphs ⋮ Characterizing and recognizing probe block graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A characterization of chain probe graphs
• The pair completion algorithm for the homogeneous set sandwich problem
• A note on finding all homogeneous set sandwiches
• Probe threshold and probe trivially perfect graphs
• The complexity of comparability graph recognition and coloring
• On probe interval graphs
• Chordal probe graphs
• Recognizing Chordal Probe Graphs and Cycle-Bicolorable Graphs
• Perfect Elimination and Chordal Bipartite Graphs
• Graph Sandwich Problems
• Computing and Combinatorics

This page was built for publication: On the bi-enhancement of chordal-bipartite probe graphs