A New Class of Brittle Graphs
From MaRDI portal
Publication:3478443
DOI10.1002/sapm198981189zbMath0701.05054OpenAlexW2597434518MaRDI QIDQ3478443
No author found.
Publication date: 1989
Published in: Studies in Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/sapm198981189
Related Items
Quasi-brittle graphs, a new class of perfectly orderable graphs, An \(O(n)\) time algorithm for maximum matching in \(P_{4}\)-tidy graphs, Recognizing well covered graphs of families with special \(P _{4}\)-components, Isomorphism of chordal (6, 3) graphs, \(P_{4}\)-laden graphs: A new class of brittle graphs, Total dominating sequences in trees, split graphs, and under modular decomposition, Clique-perfectness and balancedness of some graph classes, On graphs with a single large Laplacian eigenvalue, On the structure of graphs with few \(P_4\)s, On the \(b\)-coloring of \(P_{4}\)-tidy graphs, On the isomorphism of graphs with few P4s, Partitioning \(P_4\)-tidy graphs into a stable set and a forest, The multiple domination and limited packing problems in graphs, Classes of perfect graphs, Counting spanning trees using modular decomposition, Partial characterizations of circle graphs, A fast parallel algorithm to recognize partitionable graphs, Structural results on circular-arc graphs and circle graphs: a survey and the main open problems, On the \(P_4\)-components of graphs, Restricted coloring problems on graphs with few \(P_4\)'s, \(b\)-coloring of tight graphs, Minimal separators in extended \(P_4\)-laden graphs, A simple linear time algorithm for cograph recognition, Hitting subgraphs in \(P_4\)-tidy graphs, The clique operator on graphs with few \(P_{4}\)'s, Finding houses and holes in graphs, On some special classes of contact \(B_0\)-VPG graphs, Laplacian integrality in \(P_4\)-sparse and \(P_4\)-extendible graphs, Probe interval and probe unit interval graphs on superclasses of cographs
Cites Work
