Strongly orderable graphs. A common generalization of strongly chordal and chordal bipartite graphs
DOI10.1016/S0166-218X(99)00149-3zbMATH Open0960.05094OpenAlexW1994963913MaRDI QIDQ1962062FDOQ1962062
Authors: Feodor F. Dragan 
Publication date: 10 May 2001
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0166-218x(99)00149-3
Recommendations
maximum cliquegreedy algorithmoptimization algorithmrecognition algorithmminimum coloringchordal bipartitestrongly chordalelimination orderingstrongly orderable graph
Graph algorithms (graph-theoretic aspects) (05C85) Analysis of algorithms and problem complexity (68Q25) Structural characterization of families of graphs (05C75)
Cites Work
- Title not available (Why is that?)
- A characterization of perfect graphs
- Doubly lexical ordering of dense 0--1 matrices
- Three Partition Refinement Algorithms
- Characterizations of strongly chordal graphs
- Characterizations of totally balanced matrices
- Algorithmic Aspects of Vertex Elimination on Graphs
- Algorithms for Minimum Coloring, Maximum Clique, Minimum Covering by Cliques, and Maximum Independent Set of a Chordal Graph
- Weakly triangulated graphs
- Domination, independent domination, and duality in strongly chordal graphs
- The k-Domination and k-Stability Problems on Sun-Free Chordal Graphs
- Doubly Lexical Orderings of Matrices
- Perfect Elimination and Chordal Bipartite Graphs
- Steiner trees, connected domination and strongly chordal graphs
- Title not available (Why is that?)
- Labeling algorithms for domination problems in sun-free chordal graphs
- Computing a perfect edge without vertex elimination ordering of a chordal bipartite graph
- Greedoids
- Matching and multidimensional matching in chordal and strongly chordal graphs
- Title not available (Why is that?)
Cited In (11)
- Perfect circular arc coloring
- The graphs that Dahlhaus called ``good generalized strongly chordal
- \(L(2,1)\)-labeling of dually chordal graphs and strongly orderable graphs
- Computing a minimum paired-dominating set in strongly orderable graphs
- Minimum paired-dominating set in chordal bipartite graphs and perfect elimination bipartite graphs
- Finding a sun in building-free graphs
- Edge erasures and chordal graphs
- Coloring squares of graphs via vertex orderings
- Title not available (Why is that?)
- The Perfect Matching Reconfiguration Problem
- Strong Chordality of Graphs with Possible Loops
This page was built for publication: Strongly orderable graphs. A common generalization of strongly chordal and chordal bipartite graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1962062)
