On rigid circuit graphs

From MaRDI portal
Revision as of 10:46, 30 January 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:773621

DOI10.1007/BF02992776zbMath0098.14703OpenAlexW2035331304WikidataQ56430105 ScholiaQ56430105MaRDI QIDQ773621

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




Related Items (only showing first 100 items - show all)

Pushing vertices in digraphs without long induced cyclesA parallel algorithm for computing Steiner trees in strongly chordal graphsSigned graphs and the freeness of the Weyl subarrangements of type \(B_\ell\)Separation of two convex sets in convexity structuresThe parallel solution of domination problems on chordal and strongly chordal graphsThe generating polynomial and Euler characteristic of intersection graphsThe struction algorithm for the maximum stable set problem revisitedToughness and Hamiltonicity of a class of planar graphsDirac's theorem on chordal graphs and Alexander dualityGenerating and characterizing the perfect elimination orderings of a chordal graphEfficient algorithms for minimum weighted colouring of some classes of perfect graphsRepresenting a concept lattice by a graphAn efficient parallel algorithm for the minimal elimination ordering (MEO) of an arbitrary graphMock threshold graphsFinding minimum height elimination trees for interval graphs in polynomial timeClique tree generalization and new subclasses of chordal graphsRecognizing bull-free perfect graphsMetric graphs elastically embeddable in the planeColoring perfect degenerate graphsOn graphs in which any pair of colour classes but one induces a treeCuts, matrix completions and graph rigidityPlanar graphs with least chromatic coefficientsGraph extremities defined by search algorithmsAn introduction to clique minimal separator decompositionComputing a clique tree with the algorithm maximal label searchCharacterizations and algorithmic applications of chordal graph embeddingsUniversally signable graphsA note on perfectly orderable graphsChromaticity of chordal graphsInequalities for free multi-braid arrangementsRecognizing interval digraphs and interval bigraphs in polynomial timeMeyniel weakly triangulated graphs. II: A theorem of DiracOn the structure and chromaticity of graphs in which any two colour classes induce a treeA note on perfect ordersAn algorithm for coloring some perfect graphsA note on \(r\)-dominating cliquesOn the chromatic uniqueness of the graph \(W(n,n-2,k)\)Finding a sun in building-free graphsChordal digraphsOn treewidth and minimum fill-in of asteroidal triple-free graphsSeparability generalizes Dirac's theoremRetracts and algebraic properties of cut algebrasSequences of regressions and their independencesSome problems on induced subgraphs2-role assignments on triangulated graphs.The regularity of edge ideals of graphsA note on chromatic number of (cap, even hole)-free graphsThe type defect of a simplicial complexOn simplicial and co-simplicial vertices in graphs.Inheritance principles for chordal graphsCovering all cliques of a graphRepresentations of graphs and networks (coding, layouts and embeddings)Some aspects of the semi-perfect eliminationSurface subgroups of Coxeter and Artin groups.Some properties of graph centroidsFinding large holesAn inertia formula for Hermitian matrices with sparse inversesVertex-weighted graphs and freeness of $ \psi $-graphical arrangementsComputational complexity of the vertex cover problem in the class of planar triangulationsUnit interval vertex deletion: fewer vertices are relevantA linear-time algorithm for isomorphism of a subclass of chordal graphsOn the contour of bipartite graphsNon-edge orientation and vertex ordering characterizations of some classes of bigraphsOn slim graphs, even pairs, and star-cutsetsClique trees of infinite locally finite chordal graphsOn minimal vertex separators of dually chordal graphs: properties and characterizationsStudies on hypergraphs. I: HyperforestsRecognition and computation of minimal triangulations for AT-free claw-free and co-comparability graphsTree decompositions with small costStrong branchwidth and local transversalsConstant tolerance intersection graphs of subtrees of a treeAn algorithm for testing chordality of graphsWhat is reconstruction for ordered sets?Vertex deletion problems on chordal graphsTesting for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithmsMinimal triangulation of a graph and optimal pivoting order in a sparse matrixAlgorithms on clique separable graphsA note on perfect Gaussian eliminationKoszul binomial edge ideals of pairs of graphsThe sandwich problem for decompositions and almost monotone properties\(p\)-competition graphsCounting clique trees and computing perfect elimination schemes in parallelInduced matchingsRecognition of some perfectly orderable graph classesPhylogeny numbersA class of \(\beta\)-perfect graphsMinimal vertex separators of chordal graphsOn the semi-perfect eliminationHypergraphs with cyclomatic number zero, triangulated graphs, and an inequalitySequential colorings and perfect graphs\(P_4\)-domination in minimal imperfect graphsOn stable cutsets in graphsThe monadic second-order logic of graphs. VIII: OrientationsThe forbidden subgraph characterization of directed vertex graphsAll wheels with two missing consecutive spokes are chromatically uniqueA characterisation of rigid circuit graphsOn Tucker vertices of graphsPseudo-chordal mixed hypergraphsThe maximum clique problemFree hyperplane arrangements between \(A_{n-1}\) and \(B_ n\)




Cites Work




This page was built for publication: On rigid circuit graphs