On rigid circuit graphs

Cited in

(only showing first 100 items - show all)

Cohen-Macaulay monomial ideals of codimension 2
A linear time recognition algorithm for proper interval graphs
The clique-separator graph for chordal graphs
The competition number of a graph with exactly \(h\) holes, all of which are independent
On 2-walks in chordal planar graphs
Estimating high-dimensional intervention effects from observational data
The strong perfect graph conjecture: 40 years of attempts, and its resolution
Characterizations of strongly chordal graphs
A characterization of graphs of competition number m
On powers and centers of chordal graphs
No graph has a maximal 3-ring of bonds
Counting labelled chordal graphs
Decomposition by clique separators
Graph minors. V. Excluding a planar graph
On local convexity in graphs
A fast algorithm for finding an edge-maximal subgraph with a TR-formative coloring
On the null-homotopy of bridged graphs
Locally perfect graphs
Bridged graphs and geodesic convexity
Chordal graph recognition is in NC
Efficient parallel algorithms for finding maximal cliques, clique trees, and minimum coloring on chordal graphs
Maximal chordal subgraphs
Weak bipolarizable graphs
On diameters and radii of bridged graphs
Simplicial decompositions of graphs: A survey of applications
Recognizing claw-free perfect graphs
A note on perfect orders
Inheritance principles for chordal graphs
Covering all cliques of a graph
Representations of graphs and networks (coding, layouts and embeddings)
Some aspects of the semi-perfect elimination
Some properties of graph centroids
Finding large holes
An inertia formula for Hermitian matrices with sparse inverses
A linear-time algorithm for isomorphism of a subclass of chordal graphs
On slim graphs, even pairs, and star-cutsets
Studies on hypergraphs. I: Hyperforests
An algorithm for testing chordality of graphs
Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms
Minimal triangulation of a graph and optimal pivoting order in a sparse matrix
Algorithms on clique separable graphs
A note on perfect Gaussian elimination
Counting clique trees and computing perfect elimination schemes in parallel
Induced matchings
Phylogeny numbers
Minimal vertex separators of chordal graphs
Sequential colorings and perfect graphs
\(P_4\)-domination in minimal imperfect graphs
The forbidden subgraph characterization of directed vertex graphs
On Tucker vertices of graphs
Pseudo-chordal mixed hypergraphs
The maximum clique problem
Free hyperplane arrangements between \(A_{n-1}\) and \(B_ n\)
A parallel algorithm for computing Steiner trees in strongly chordal graphs
Separation of two convex sets in convexity structures
The parallel solution of domination problems on chordal and strongly chordal graphs
The generating polynomial and Euler characteristic of intersection graphs
The struction algorithm for the maximum stable set problem revisited
Efficient algorithms for minimum weighted colouring of some classes of perfect graphs
An efficient parallel algorithm for the minimal elimination ordering (MEO) of an arbitrary graph
Finding minimum height elimination trees for interval graphs in polynomial time
Clique tree generalization and new subclasses of chordal graphs
Metric graphs elastically embeddable in the plane
Coloring perfect degenerate graphs
On graphs in which any pair of colour classes but one induces a tree
Cuts, matrix completions and graph rigidity
Planar graphs with least chromatic coefficients
Characterizations and algorithmic applications of chordal graph embeddings
Universally signable graphs
Chromaticity of chordal graphs
Recognizing interval digraphs and interval bigraphs in polynomial time
Meyniel weakly triangulated graphs. II: A theorem of Dirac
On the structure and chromaticity of graphs in which any two colour classes induce a tree
An algorithm for coloring some perfect graphs
A note on \(r\)-dominating cliques
On treewidth and minimum fill-in of asteroidal triple-free graphs
Separability generalizes Dirac's theorem
2-role assignments on triangulated graphs.
On simplicial and co-simplicial vertices in graphs.
Surface subgroups of Coxeter and Artin groups.
A class of -perfect graphs
On stable cutsets in graphs
All wheels with two missing consecutive spokes are chromatically unique
Pushing vertices in digraphs without long induced cycles
Signed graphs and the freeness of the Weyl subarrangements of type \(B_\ell\)
Mock threshold graphs
Graph extremities defined by search algorithms
An introduction to clique minimal separator decomposition
Computing a clique tree with the algorithm maximal label search
Inequalities for free multi-braid arrangements
Retracts and algebraic properties of cut algebras
Some problems on induced subgraphs
A note on chromatic number of (cap, even hole)-free graphs
The type defect of a simplicial complex
Vertex-weighted graphs and freeness of \psi -graphical arrangements
Computational complexity of the vertex cover problem in the class of planar triangulations
Unit interval vertex deletion: fewer vertices are relevant
On the contour of bipartite graphs
Non-edge orientation and vertex ordering characterizations of some classes of bigraphs
Clique trees of infinite locally finite chordal graphs

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)