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)
Pushing vertices in digraphs without long induced cycles ⋮ A parallel algorithm for computing Steiner trees in strongly chordal graphs ⋮ Signed graphs and the freeness of the Weyl subarrangements of type \(B_\ell\) ⋮ 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 ⋮ Toughness and Hamiltonicity of a class of planar graphs ⋮ Dirac's theorem on chordal graphs and Alexander duality ⋮ Generating and characterizing the perfect elimination orderings of a chordal graph ⋮ Efficient algorithms for minimum weighted colouring of some classes of perfect graphs ⋮ Representing a concept lattice by a graph ⋮ An efficient parallel algorithm for the minimal elimination ordering (MEO) of an arbitrary graph ⋮ Mock threshold graphs ⋮ Finding minimum height elimination trees for interval graphs in polynomial time ⋮ Clique tree generalization and new subclasses of chordal graphs ⋮ Recognizing bull-free perfect 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 ⋮ Graph extremities defined by search algorithms ⋮ An introduction to clique minimal separator decomposition ⋮ Computing a clique tree with the algorithm maximal label search ⋮ Characterizations and algorithmic applications of chordal graph embeddings ⋮ Universally signable graphs ⋮ A note on perfectly orderable graphs ⋮ Chromaticity of chordal graphs ⋮ Inequalities for free multi-braid arrangements ⋮ 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 ⋮ A note on perfect orders ⋮ An algorithm for coloring some perfect graphs ⋮ A note on \(r\)-dominating cliques ⋮ On the chromatic uniqueness of the graph \(W(n,n-2,k)\) ⋮ Finding a sun in building-free graphs ⋮ Chordal digraphs ⋮ On treewidth and minimum fill-in of asteroidal triple-free graphs ⋮ Separability generalizes Dirac's theorem ⋮ Retracts and algebraic properties of cut algebras ⋮ Sequences of regressions and their independences ⋮ Some problems on induced subgraphs ⋮ 2-role assignments on triangulated graphs. ⋮ The regularity of edge ideals of graphs ⋮ A note on chromatic number of (cap, even hole)-free graphs ⋮ The type defect of a simplicial complex ⋮ On simplicial and co-simplicial vertices in graphs. ⋮ 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 ⋮ Surface subgroups of Coxeter and Artin groups. ⋮ Some properties of graph centroids ⋮ Finding large holes ⋮ An inertia formula for Hermitian matrices with sparse inverses ⋮ 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 ⋮ A linear-time algorithm for isomorphism of a subclass of chordal graphs ⋮ On the contour of bipartite graphs ⋮ Non-edge orientation and vertex ordering characterizations of some classes of bigraphs ⋮ On slim graphs, even pairs, and star-cutsets ⋮ Clique trees of infinite locally finite chordal graphs ⋮ On minimal vertex separators of dually chordal graphs: properties and characterizations ⋮ Studies on hypergraphs. I: Hyperforests ⋮ Recognition and computation of minimal triangulations for AT-free claw-free and co-comparability graphs ⋮ Tree decompositions with small cost ⋮ Strong branchwidth and local transversals ⋮ Constant tolerance intersection graphs of subtrees of a tree ⋮ An algorithm for testing chordality of graphs ⋮ What is reconstruction for ordered sets? ⋮ Vertex deletion problems on chordal 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 ⋮ Koszul binomial edge ideals of pairs of graphs ⋮ The sandwich problem for decompositions and almost monotone properties ⋮ \(p\)-competition graphs ⋮ Counting clique trees and computing perfect elimination schemes in parallel ⋮ Induced matchings ⋮ Recognition of some perfectly orderable graph classes ⋮ Phylogeny numbers ⋮ A class of \(\beta\)-perfect graphs ⋮ Minimal vertex separators of chordal graphs ⋮ On the semi-perfect elimination ⋮ Hypergraphs with cyclomatic number zero, triangulated graphs, and an inequality ⋮ Sequential colorings and perfect graphs ⋮ \(P_4\)-domination in minimal imperfect graphs ⋮ On stable cutsets in graphs ⋮ The monadic second-order logic of graphs. VIII: Orientations ⋮ The forbidden subgraph characterization of directed vertex graphs ⋮ All wheels with two missing consecutive spokes are chromatically unique ⋮ A characterisation of rigid circuit graphs ⋮ On Tucker vertices of graphs ⋮ Pseudo-chordal mixed hypergraphs ⋮ The maximum clique problem ⋮ Free hyperplane arrangements between \(A_{n-1}\) and \(B_ n\)
Cites Work
This page was built for publication: On rigid circuit graphs