Pages that link to "Item:Q1179261"
From MaRDI portal
The following pages link to Classes of bipartite graphs related to chordal graphs (Q1179261):
Displaying 19 items.
- Graph modification problem for some classes of graphs (Q350726) (← links)
- Minimum paired-dominating set in chordal bipartite graphs and perfect elimination bipartite graphs (Q386432) (← links)
- Algorithmic aspects of \(k\)-tuple total domination in graphs (Q456136) (← links)
- Chordal bipartite graphs with high boxicity (Q659714) (← links)
- Absolute reflexive retracts and absolute bipartite retracts (Q686243) (← links)
- On bipartite graphs with weak density of some subgraphs (Q878650) (← links)
- On the complexity of the sandwich problems for strongly chordal graphs and chordal bipartite graphs (Q995559) (← links)
- Bi-complement reducible graphs (Q1356114) (← links)
- Recognizing interval digraphs and interval bigraphs in polynomial time (Q1377666) (← links)
- Lex-BFS and partition refinement, with applications to transitive orientation, interval graph recognition and consecutive ones testing (Q1575664) (← links)
- Incidence graphs of biacyclic hypergraphs (Q1923616) (← links)
- Chordal bipartite completion of colored graphs (Q2427516) (← links)
- Injective coloring of some subclasses of bipartite graphs and chordal graphs (Q2659063) (← links)
- Beyond Helly graphs: the diameter problem on absolute retracts (Q2672446) (← links)
- SIMPLE MAX-CUT for unit interval graphs and graphs with few \(P4\)s (Q2741323) (← links)
- COMPLEXITY OF CERTAIN FUNCTIONAL VARIANTS OF TOTAL DOMINATION IN CHORDAL BIPARTITE GRAPHS (Q3166754) (← links)
- BIPARTITE GRAPHS TOTALLY DECOMPOSABLE BY CANONICAL DECOMPOSITION (Q5249025) (← links)
- LINEAR TIME RECOGNITION AND OPTIMIZATIONS FOR WEAK-BISPLIT GRAPHS, BI-COGRAPHS AND BIPARTITE P<sub>6</sub>-FREE GRAPHS (Q5696896) (← links)
- Algorithms for maximum matching and minimum fill-in on chordal bipartite graphs (Q6487434) (← links)
