On rigid circuit graphs

Cited in

(only showing first 100 items - show all)

On the Colin de Verdière number of graphs
Behaviors of pairs of dimensions and depths of edge ideals
Two strikes against perfect phylogeny
A note on \(r\)-dominating cliques
Beyond recognizing well-covered graphs
Toll convexity
Homological shift ideals
Non-ridge-chordal complexes whose clique complex has shellable Alexander dual
Minimum Fill-In and Treewidth of Split+ ke and Split+ kv Graphs
Representation characterizations of chordal bipartite graphs
A generalization of the theorem of Lekkerkerker and Boland
Cycle intersection in spanning trees: a shorter proof of a conjecture and applications
On the null-homotopy of bridged graphs
A Characterisation of the Minimal Triangulations of Permutation Graphs
How to use the minimal separators of a graph for its chordal triangulation
Dot product dimensions of graphs
Incidence matrices with the consecutive 1’s property
Graphs with sparsity order at most two: the complex case
Asteroidal triples of moplexes
Linear resolutions of quadratic monomial ideals
The dense amalgam of metric compacta and topological characterization of boundaries of free products of groups
Helly theorems for 3-Steiner and 3-monophonic convexity in graphs
Clique coverings and claw-free graphs
Inductive \(k\)-independent graphs and \(c\)-colorable subgraphs in scheduling: a review
Betti numbers of chordal graphs and \(f\)-vectors of simplicial complexes
Minimal vertex separators and new characterizations for dually chordal graphs
The k-Domination and k-Stability Problems on Sun-Free Chordal Graphs
On axioms constituting the foundation of hypergraph theory
Lower bounds and properties for the average number of colors in the non-equivalent colorings of a graph
\(b\)-vectors of chordal graphs
I/O-efficient algorithms for graphs of bounded treewidth
A note on independence complexes of chordal graphs and dismantling
A fast algorithm for finding an edge-maximal subgraph with a TR-formative coloring
Chordal graph recognition is in NC
Cycle Extendability of Hamiltonian Strongly Chordal Graphs
Bayesian networks: the minimal triangulations of a graph
On the phylogeny graphs of degree-bounded digraphs
On domination elimination orderings and domination graphs
Dirac's theorem on chordal graphs implies Brooks' theorem
Detecting fixed patterns in chordal graphs in polynomial time
Exact algorithms for restricted subset feedback vertex set in chordal and split graphs
A Dirac-type characterization of \(k\)-chordal graphs
Graphs with a unique maximum independent set up to automorphisms
A linear time algorithm for minimum fill-in and treewidth for distance hereditary graphs
Polynomial time algorithms for computing a minimum hull set in distance-hereditary and chordal graphs
The maximum clique problem
Heroes in orientations of chordal graphs
Graphs with all holes the same length
Structural submodularity and tangles in abstract separation systems
Colouring square-free graphs without long induced paths
Growing trees and amoebas' replications
Organizing the atoms of the clique separator decomposition into an atom tree
Tree decomposition and discrete optimization problems: a survey
Simplicial orders and chordality
Bisimplicial separators
Minimal vertex separators of chordal graphs
Linear-time algorithms for tree root problems
Erdős-Ko-Rado theorems for chordal graphs and trees
On compact and efficient routing in certain graph classes
Characterizing and computing the structure of clique intersections in strongly chordal graphs
An efficient parallel algorithm for the minimal elimination ordering (MEO) of an arbitrary graph
On the Lovász-Schrijver PSD-operator on graph classes defined by clique cutsets
Some aspects of the semi-perfect elimination
The convex set forming game
Chordal graphs and their clique graphs
A simple linear time algorithm for triangulating three-colored graphs
On graphs with equal total domination and Grundy total domination numbers
On 3-degree 4-chordal graphs
Coloring perfect degenerate graphs
The (theta, wheel)-free graphs. I: Only-prism and only-pyramid graphs
The generating polynomial and Euler characteristic of intersection graphs
Treewidth versus clique number. II: Tree-independence number
Supersolvable saturated matroids and chordal graphs
Pushing vertices in digraphs without long induced cycles
Cohen-Macaulay binomial edge ideals
Locally perfect graphs
Linear separation of connected dominating sets in graphs
On the complexity of the black-and-white coloring problem on some classes of perfect graphs
Inheritance principles for chordal graphs
Zero-divisor graphs of Catalan monoid
Representing a concept lattice by a graph
Drawings of planar graphs with few slopes and segments
Graphs of separability at most 2
On slim graphs, even pairs, and star-cutsets
Upper bounds for the regularity of powers of edge ideals of graphs
Efficiently decomposing, recognizing and triangulating hole-free graphs without diamonds
Finding large holes
On listing, sampling, and counting the chordal graphs with edge constraints
Extending cycles in graphs
A Separator Theorem for Chordal Graphs
Unit interval vertex deletion: fewer vertices are relevant
Free hyperplane arrangements between \(A_{n-1}\) and \(B_ n\)
Castelnuovo-Mumford regularity under reduction processes on graphs and hypergraphs
Counting labelled chordal graphs
Recognition of chordal graphs and cographs which are cover-incomparability graphs
Simplicial nonpositive curvature
A vertex incremental approach for maintaining chordality
Optimality of DSatur algorithm on chordal graphs
On the Hadwiger's conjecture for graph products
Characterizations and algorithmic applications of chordal graph embeddings

This page was built for publication: On rigid circuit graphs

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