The following pages link to On rigid circuit graphs (Q773621):
Displaying 50 items.
- Local medians in chordal graphs (Q2640607) (← links)
- Polynomially bounding the number of minimal separators in graphs: reductions, sufficient conditions, and a dichotomy theorem (Q2656894) (← links)
- Finding a maximum minimal separator: graph classes and fixed-parameter tractability (Q2661784) (← links)
- Complexity and approximability of the happy set problem (Q2662689) (← links)
- Fuzzy chordal graphs and its properties (Q2669841) (← links)
- Computing partial hypergraphs of bounded width (Q2686128) (← links)
- Componentwise linearity of powers of cover ideals (Q2688250) (← links)
- Higher chordality: from graphs to complexes (Q2809187) (← links)
- A Polynomial Delay Algorithm for Enumerating Minimal Dominating Sets in Chordal Graphs (Q2827808) (← links)
- On some simplicial elimination schemes for chordal graphs (Q2839220) (← links)
- Minimal vertex separators and new characterizations for dually chordal graphs (Q2840528) (← links)
- Vertex Ordering Characterizations of Graphs of Bounded Asteroidal Number (Q2940988) (← links)
- Minimum Average Distance Clique Trees (Q2947438) (← links)
- Amalgams and χ-Boundedness (Q2958199) (← links)
- Antimatroids, Betweenness, Convexity (Q2971604) (← links)
- Graphs of Separability at Most Two: Structural Characterizations and Their Consequences (Q3000517) (← links)
- Powers of the Vertex Cover Ideal of a Chordal Graph (Q3113829) (← links)
- Cohen-Macaulay binomial edge ideals (Q3115816) (← links)
- Two-Player Competitive Diffusion Game: Graph Classes and the Existence of a Nash Equilibrium (Q3297794) (← links)
- Colouring square-free graphs without long induced paths. (Q3304134) (← links)
- A Separator Theorem for Chordal Graphs (Q3344230) (← links)
- When Is a Graph Product of Groups Virtually-Free? (Q3429307) (← links)
- A New Construction for Cohen–Macaulay Graphs (Q3448561) (← links)
- Some Cohen–Macaulay and Unmixed Binomial Edge Ideals (Q3448586) (← links)
- Koszul Binomial Edge Ideals (Q3455099) (← links)
- A Characterisation of the Minimal Triangulations of Permutation Graphs (Q3508558) (← links)
- On Listing, Sampling, and Counting the Chordal Graphs with Edge Constraints (Q3511357) (← links)
- Probe Ptolemaic Graphs (Q3511358) (← links)
- Standard graded vertex cover algebras, cycles and leaves (Q3542001) (← links)
- A Localization Approach to Improve Iterative Proportional Scaling in Gaussian Graphical Models (Q3585266) (← links)
- A new approach to chordal graphs (Q3617966) (← links)
- Characterizing path graphs by forbidden induced subgraphs (Q3652563) (← links)
- The <i>k</i>-Domination and <i>k</i>-Stability Problems on Sun-Free Chordal Graphs (Q3697054) (← links)
- Convexity in Graphs and Hypergraphs (Q3718757) (← links)
- Polynomially bounded algorithms for locatingp-centers on a tree (Q3947422) (← links)
- Binary Supersolvable Matroids and Modular Constructions (Q3982141) (← links)
- An nc algorithm to recognize hhd-free graphs (Q4009712) (← links)
- s-strongly perfect cartesian product of graphs (Q4014269) (← links)
- Expansions of Chromatic Polynomials and Log-Concavity (Q4018926) (← links)
- Restricted unimodular chordal graphs (Q4229266) (← links)
- Lexbfs-orderings and powers of hhd-free graphs<sup>∗</sup> (Q4254590) (← links)
- Powers of hhd-free graphs<sup>∗</sup> (Q4256126) (← links)
- Matrices with chordal inverse zero-patterns (Q4274547) (← links)
- Some constructions of $\lambda$-minimal graphs (Q4324011) (← links)
- Efficient parallel graph algorithms for coarse grained multicomputers and BSP (Q4571970) (← links)
- Characterizing k-chordal unichord-free graphs (Q4577849) (← links)
- Edgewise strongly shellable clutters (Q4599711) (← links)
- Graphs with sparsity order at most two: the complex case (Q4603775) (← links)
- A New Class of Graphs That Satisfies the Chen‐Chvátal Conjecture (Q4604017) (← links)
- On the structure of (pan, even hole)‐free graphs (Q4604020) (← links)
