On rigid circuit graphs

DOI10.1007/BF02992776zbMATH Open0098.14703OpenAlexW2035331304WikidataQ56430105 ScholiaQ56430105MaRDI QIDQ773621FDOQ773621

Authors: G. A. Dirac 

Publication date: 1961

Published in: Abhandlungen aus dem Mathematischen Seminar der Universität Hamburg (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02992776

zbMATH Keywords

topology

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (only showing first 100 items - show all)

• Polynomial time algorithms for computing a minimum hull set in distance-hereditary and chordal graphs
• I/O-efficient algorithms for graphs of bounded treewidth
• A fast algorithm for finding an edge-maximal subgraph with a TR-formative coloring
• Chordal graph recognition is in NC
• Chordal graphs and their clique graphs
• Minimal vertex separators of chordal graphs
• Linear-time algorithms for tree root problems
• On compact and efficient routing in certain graph classes
• An efficient parallel algorithm for the minimal elimination ordering (MEO) of an arbitrary graph
• On graphs with equal total domination and Grundy total domination numbers
• Free hyperplane arrangements between \(A_{n-1}\) and \(B_ n\)
• Characterizing k-chordal unichord-free graphs
• Local topology of the free complex of a two-dimensional generalized convex shelling
• Finding houses and holes in graphs
• Cuts, matrix completions and graph rigidity
• Vertex rankings of chordal graphs and weighted trees
• Solving the clique cover problem on (bull, \(C_4\))-free graphs
• Weak bipolarizable graphs
• A localization approach to improve iterative proportional scaling in Gaussian graphical models
• Title not available (Why is that?)
• The intersection of two vertex coloring problems
• Colouring square-free graphs without long induced paths
• On Listing, Sampling, and Counting the Chordal Graphs with Edge Constraints
• Characterizations of \((4 K_1,C_4,C_5)\)-free graphs
• Separation of two convex sets in convexity structures
• On the computational complexity of ordered subgraph recognition
• Efficient parallel algorithms for finding maximal cliques, clique trees, and minimum coloring on chordal graphs
• Special eccentric vertices for the class of chordal graphs and related classes
• Subadditivity, strand connectivity and multigraded Betti numbers of monomial ideals
• Bounding the projective dimension of a squarefree monomial ideal via domination in clutters
• Decomposable clutters and a generalization of Simon's conjecture
• Homotopy equivalence in finite digital images
• Critical exponents of graphs
• The firefighter problem on graph classes
• Amalgams and \(\chi\)-boundedness
• Classes of perfect graphs
• Improving on the maximum likelihood estimators of the means in Poisson decomposable graphical models
• Cohen-Macaulay monomial ideals of codimension 2
• Studies on hypergraphs. I: Hyperforests
• The strong perfect graph conjecture: 40 years of attempts, and its resolution
• Licci binomial edge ideals
• Totally balanced dissimilarities
• \(k\)-power domination in block graphs
• Efficient parallel graph algorithms for coarse grained multicomputers and BSP
• Centers of triangulated graphs
• Linear-time generation of random chordal graphs
• Crown-free lattices and their related graphs
• Faster parameterized algorithms for \textsc{Minimum Fill-in}
• On the representation of triangulation graphs in trees
• All 4-edge-connected HHD-free graphs are \({\mathbb{Z}}_3\)-connected
• Dirac's theorem on simplicial matroids
• Shellable quasi-forests and their \(h\)-triangles
• Binary Supersolvable Matroids and Modular Constructions
• How is a chordal graph like a supersolvable binary matroid?
• Some Cohen-Macaulay and unmixed binomial edge ideals
• Signed graphs and the freeness of the Weyl subarrangements of type \(B_\ell\)
• Vertex-weighted graphs and freeness of $ \psi $-graphical arrangements
• Penta-extensions of hereditary classes of graphs
• A note on lexicographic breadth first search for chordal graphs
• Complexity of simplicial homology and independence complexes of chordal graphs
• All wheels with two missing consecutive spokes are chromatically unique
• Incidence matrices with the consecutive 1’s property
• How to use the minimal separators of a graph for its chordal triangulation
• A Characterisation of the Minimal Triangulations of Permutation Graphs
• Linear resolutions of quadratic monomial ideals
• Clique coverings and claw-free graphs
• On axioms constituting the foundation of hypergraph theory
• Helly theorems for 3-Steiner and 3-monophonic convexity in graphs
• A linear time algorithm for minimum fill-in and treewidth for distance hereditary graphs
• Organizing the atoms of the clique separator decomposition into an atom tree
• On the Lovász-Schrijver PSD-operator on graph classes defined by clique cutsets
• Characterizing and computing the structure of clique intersections in strongly chordal graphs
• Cohen-Macaulay binomial edge ideals
• Representing a concept lattice by a graph
• Efficiently decomposing, recognizing and triangulating hole-free graphs without diamonds
• Graphs of separability at most 2
• Finding large holes
• Unit interval vertex deletion: fewer vertices are relevant
• A vertex incremental approach for maintaining chordality
• On the Hadwiger's conjecture for graph products
• Generating and characterizing the perfect elimination orderings of a chordal graph
• Chordal digraphs
• The competition number of a graph with exactly two holes
• A linear time recognition algorithm for proper interval graphs
• Independence complexes of chordal graphs
• The competition number of a graph with exactly \(h\) holes, all of which are independent
• Recognizing interval digraphs and interval bigraphs in polynomial time
• Recognition and computation of minimal triangulations for AT-free claw-free and co-comparability graphs
• Toric chordality
• A characterisation of rigid circuit graphs
• Separability generalizes Dirac's theorem
• Minimal triangulation of a graph and optimal pivoting order in a sparse matrix
• Matrices with chordal inverse zero-patterns
• Probe Ptolemaic Graphs
• On right-angled Artin groups without surface subgroups.
• An introduction to clique minimal separator decomposition
• Graph extremities defined by search algorithms
• Fully dynamic algorithm for chordal graphs with \(O(1)\) query-time and \(O(n^2)\) update-time
• Universally signable graphs
• Higher chordality: from graphs to complexes

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)