Classes of bipartite graphs related to chordal graphs

DOI10.1016/0166-218X(91)90023-PMaRDI QIDQ1179261zbMATH OpenFDO

Authors Andreas Brandstädt

Publication date 26 June 1992

Published in Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0166-218X(91)90023-P

zbMATH Keywords

bipartite graphschordal graphschordalityperfect elimination bipartite graphssemichordalitysplit graphs

Mathematics Subject Classification ID

Paths and cycles (05C38) Structural characterization of families of graphs (05C75) Graph theory (05C99)

Recommendations

• Chordal bipartite, strongly chordal, and strongly chordal bipartite graphs
• Several results on chordal bipartite graphs
• scientific article; zbMATH DE number 4193736
• Non-inclusion and other subclasses of chordal graphs

Cites work

• Characterizations of strongly chordal graphs
• Characterizations of totally balanced matrices
• scientific article; zbMATH DE number 3859178 (Why is no real title available?)
• scientific article; zbMATH DE number 3632548 (Why is no real title available?)
• Incidence matrices and interval graphs
• Totally-Balanced and Greedy Matrices

Cited in

(24)

• Bi-complement reducible graphs
• Recognizing interval digraphs and interval bigraphs in polynomial time
• Lex-BFS and partition refinement, with applications to transitive orientation, interval graph recognition and consecutive ones testing
• Chordal bipartite, strongly chordal, and strongly chordal bipartite graphs
• Incidence graphs of biacyclic hypergraphs
• Chordal bipartite completion of colored graphs
• Injective coloring of some subclasses of bipartite graphs and chordal graphs
• Beyond Helly graphs: the diameter problem on absolute retracts
• SIMPLE MAX-CUT for unit interval graphs and graphs with few P4s
• Complexity of certain functional variants of total domination in chordal bipartite graphs
• Graph modification problem for some classes of graphs
• Minimum paired-dominating set in chordal bipartite graphs and perfect elimination bipartite graphs
• Several results on chordal bipartite graphs
• Algorithmic aspects of \(k\)-tuple total domination in graphs
• The Dilworth number of auto-chordal bipartite graphs
• Bipartite graphs totally decomposable by canonical decomposition
• LINEAR TIME RECOGNITION AND OPTIMIZATIONS FOR WEAK-BISPLIT GRAPHS, BI-COGRAPHS AND BIPARTITE P₆-FREE GRAPHS
• Dually chordal graphs
• Algorithms for maximum matching and minimum fill-in on chordal bipartite graphs
• Chordal bipartite graphs with high boxicity
• Absolute reflexive retracts and absolute bipartite retracts
• Characterizing s-strongly chordal bipartite graphs
• On bipartite graphs with weak density of some subgraphs
• On the complexity of the sandwich problems for strongly chordal graphs and chordal bipartite graphs

This page was built for publication: Classes of bipartite graphs related to chordal graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1179261)