Weak bipolarizable graphs

DOI10.1016/0012-365X(89)90208-2zbMath0666.05062MaRDI QIDQ1116961

Stephan Olariu

Publication date: 1989

Published in: Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

perfectly orderable graphsrecognition algorithm

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Structural characterization of families of graphs (05C75) Software, source code, etc. for problems pertaining to combinatorics (05-04)

Related Items

Lexbfs-orderings and powers of hhd-free graphs^∗, Powers of hhd-free graphs^∗, Quasi-brittle graphs, a new class of perfectly orderable graphs, Linear time optimization algorithms for \(P_ 4\)-sparse graphs, A New Class of Brittle Graphs, Duchet-type theorems for powers of HHD-free graphs, Computing the hull and interval numbers in the weakly toll convexity, Finding a central vertex in an HHD-free graph, Distance labeling scheme and split decomposition, A fast parallel algorithm to recognize partitionable graphs, Some aspects of the semi-perfect elimination, An \(O(nm)\)-time certifying algorithm for recognizing HHD-free graphs, Recognition of some perfectly orderable graph classes, Extension of hereditary classes with substitutions, Fully Polynomial FPT Algorithms for Some Classes of Bounded Clique-width Graphs, Oracles for vertex elimination orderings, Convex geometries over induced paths with bounded length, The maximum clique problem

Cites Work

• Unnamed Item
• Unnamed Item
• On rigid circuit graphs
• Topics on perfect graphs
• Tolerance graphs
• A note on superbrittle graphs
• On brittle graphs
• Four classes of perfectly orderable graphs
• Algorithmic Aspects of Vertex Elimination on Graphs