scientific article
From MaRDI portal
Publication:3271426
zbMath0093.37801MaRDI QIDQ3271426
Publication date: 1958
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items
Perfect edge domination and efficient edge domination in graphs, Minimal triangulations of graphs: a survey, Disjointness graphs of segments in the space, The Comparability Graph of a Tree, Linear-Time Generation of Random Chordal Graphs, Graphs of edge-intersecting and non-splitting paths, New classes of perfect graphs, Chordal editing is fixed-parameter tractable, Characterizing directed path graphs by forbidden asteroids, Motivations and history of some of my conjectures, A semi-strong perfect graph theorem, Labeling algorithms for domination problems in sun-free chordal graphs, Universally signable graphs, Algorithmic aspects of the generalized clique-transversal problem on chordal graphs, Recent techniques and results on the Erdős-Pósa property, On Strict (Outer-)Confluent Graphs, The Hadwiger number, chordal graphs and \(ab\)-perfection, On point covers of multiple intervals and axis-parallel rectangles, On strictly chordality-\(k\) graphs, Covering, Packing and Generalized Perfection, Zur Theorie der perfekten Graphen, Clique separator decomposition of hole-free and diamond-free graphs and algorithmic consequences, Computing partial hypergraphs of bounded width, Probe Ptolemaic Graphs, Lower bounds for piercing and coloring boxes, Classes of perfect graphs, On the complexity of the black-and-white coloring problem on some classes of perfect graphs, Centers of chordal graphs, On packing and covering numbers of graphs, Piercing axis-parallel boxes, On slim graphs, even pairs, and star-cutsets, Tree decomposition and discrete optimization problems: a survey, Helly theorems for 3-Steiner and 3-monophonic convexity in graphs, Studies on hypergraphs. I: Hyperforests, A Separator Theorem for Chordal Graphs, Representation characterizations of chordal bipartite graphs, Vertex deletion problems on chordal graphs, Matroidal graphs, Infinite triangulated graphs, Induced matchings, A Ramsey-type theorem and its application to relatives of Helly's theorem, Characterizing path graphs by forbidden induced subgraphs, On rigid circuit graphs, Brambles and independent packings in chordal graphs, Transversals of 2-intervals, a topological approach, Some remarks on interval graphs, A characterisation of rigid circuit graphs, Pseudo-chordal mixed hypergraphs, Weakly triangulated graphs, Vertex Deletion Problems on Chordal Graphs, On the interval chromatic number of proper interval graphs
