On rigid circuit graphs
From MaRDI portal
Publication:773621
DOI10.1007/BF02992776zbMath0098.14703OpenAlexW2035331304WikidataQ56430105 ScholiaQ56430105MaRDI QIDQ773621
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
Related Items (only showing first 100 items - show all)
Minimal triangulations of graphs: a survey ⋮ A vertex incremental approach for maintaining chordality ⋮ Graph minors. V. Excluding a planar graph ⋮ Castelnuovo-Mumford regularity under reduction processes on graphs and hypergraphs ⋮ I/O-efficient algorithms for graphs of bounded treewidth ⋮ On local convexity in graphs ⋮ Induced cycles in triangle graphs ⋮ On basic chordal graphs and some of its subclasses ⋮ Chordal editing is fixed-parameter tractable ⋮ Vertex rankings of chordal graphs and weighted trees ⋮ A fast algorithm for finding an edge-maximal subgraph with a TR-formative coloring ⋮ Cohen-Macaulay admissible clutters ⋮ On the null-homotopy of bridged graphs ⋮ Partial inversion for linear systems and partial closure of independence graphs ⋮ Locally perfect graphs ⋮ Bridged graphs and geodesic convexity ⋮ Chordal graph recognition is in NC ⋮ Simplicial nonpositive curvature ⋮ Max point-tolerance graphs ⋮ A sufficient condition to extend polynomial results for the maximum independent set problem ⋮ Efficient parallel algorithms for finding maximal cliques, clique trees, and minimum coloring on chordal graphs ⋮ On the Hadwiger's conjecture for graph products ⋮ Improving on the maximum likelihood estimators of the means in Poisson decomposable graphical models ⋮ 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 ⋮ Complete intersection toric ideals of oriented graphs and chorded-theta subgraphs ⋮ Two characterisations of the minimal triangulations of permutation graphs ⋮ A Dirac-type characterization of \(k\)-chordal graphs ⋮ Regularity of edge ideals of \(C_{4}\)-free graphs via the topology of the lcm-lattice ⋮ Homotopy equivalence in finite digital images ⋮ Organizing the atoms of the clique separator decomposition into an atom tree ⋮ Clique separator decomposition of hole-free and diamond-free graphs and algorithmic consequences ⋮ Graphs of separability at most 2 ⋮ The firefighter problem on graph classes ⋮ Critical exponents of graphs ⋮ Minimal free resolutions of linear edge ideals ⋮ Bounds on the Stanley depth and Stanley regularity of edge ideals of clutters ⋮ On the discovery of the cycle-axiom of hypergraphs ⋮ On the Colin de Verdière number of graphs ⋮ Sphere representations, stacked polytopes, and the Colin de Verdière number of a graph ⋮ Combinatorial topology and the global dimension of algebras arising in combinatorics ⋮ The competition number of a graph with exactly two holes ⋮ Probability distributions with summary graph structure ⋮ Centers of triangulated graphs ⋮ Fully dynamic algorithm for chordal graphs with \(O(1)\) query-time and \(O(n^2)\) update-time ⋮ An optimal greedy heuristic to color interval graphs ⋮ Crown-free lattices and their related graphs ⋮ Faster parameterized algorithms for \textsc{Minimum Fill-in} ⋮ Fair cost allocations under conflicts - a game-theoretic point of view - ⋮ Some properties of edge intersection graphs of single-bend paths on a grid ⋮ All 4-edge-connected HHD-free graphs are \({\mathbb{Z}}_3\)-connected ⋮ Dirac's theorem on simplicial matroids ⋮ Local topology of the free complex of a two-dimensional generalized convex shelling ⋮ Characterizing and computing the structure of clique intersections in strongly chordal graphs ⋮ Shellable quasi-forests and their \(h\)-triangles ⋮ A note on lexicographic breadth first search for chordal graphs ⋮ New results on Ptolemaic graphs ⋮ Stability of Betti numbers under reduction processes: towards chordality of clutters ⋮ Complexity of simplicial homology and independence complexes of chordal graphs ⋮ More bounds for the Grundy number of graphs ⋮ Learning discrete decomposable graphical models via constraint optimization ⋮ Which claw-free graphs are perfectly orderable? ⋮ On the SPANNING \(k\)-TREE problem ⋮ Chordal Coxeter groups. ⋮ Betti numbers of chordal graphs and \(f\)-vectors of simplicial complexes ⋮ A constant approximation algorithm for the densest \(k\)-subgraph problem on chordal graphs ⋮ Treewidth computations. I: Upper bounds ⋮ Helly theorems for 3-Steiner and 3-monophonic convexity in graphs ⋮ On right-angled Artin groups without surface subgroups. ⋮ How is a chordal graph like a supersolvable binary matroid? ⋮ On listing, sampling, and counting the chordal graphs with edge constraints ⋮ Independence complexes of chordal graphs ⋮ On split-coloring problems ⋮ On compact and efficient routing in certain graph classes ⋮ Cohen-Macaulay monomial ideals of codimension 2 ⋮ Enumerating minimal dominating sets in chordal graphs ⋮ Special eccentric vertices for the class of chordal graphs and related classes ⋮ A linear time recognition algorithm for proper interval graphs ⋮ Extending cycles in graphs ⋮ The clique-separator graph for chordal graphs ⋮ The competition number of a graph with exactly \(h\) holes, all of which are independent ⋮ Licci binomial edge ideals ⋮ Totally balanced dissimilarities ⋮ 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 ⋮ Some aspects of perfect elimination orderings in chordal graphs ⋮ A characterization of graphs of competition number m ⋮ On powers and centers of chordal graphs ⋮ On the representation of triangulation graphs in trees ⋮ No graph has a maximal 3-ring of bonds ⋮ Weakly triangulated graphs ⋮ Counting labelled chordal graphs ⋮ Decomposition by clique separators ⋮ Penta-extensions of hereditary classes of graphs ⋮ The dense amalgam of metric compacta and topological characterization of boundaries of free products of groups
Cites Work
This page was built for publication: On rigid circuit graphs
