Recognition of some perfectly orderable graph classes

DOI10.1016/S0166-218X(02)00499-7zbMATH Open1019.68075MaRDI QIDQ1811119FDOQ1811119

Authors: Elaine M. Eschen, Julie L. Johnson, Jeremy P. Spinrad, R. Sritharan 

Publication date: 10 June 2003

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

Recommendations

• Recognizing bipolarizable and \(P _{4}\)-simplicial graphs.
• On the recognition of bipolarizable and \(P_4\)-simplicial graphs
• Four classes of perfectly orderable graphs
• Some classes of perfectly orderable graphs
• On the complexity of recognizing a class of perfectly orderable graphs

zbMATH Keywords

recognition algorithmperfectly orderable graphbrittle graph

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Structural characterization of families of graphs (05C75)

Cites Work

• Title not available (Why is that?)
• Graph Classes: A Survey
• Modular decomposition and transitive orientation
• Incidence matrices and interval graphs
• On rigid circuit graphs
• Matrix multiplication via arithmetic progressions
• Triangulated graphs and the elimination process
• An upper bound for the chromatic number of a graph and its application to timetabling problems
• Algorithmic Aspects of Vertex Elimination on Graphs
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Four classes of perfectly orderable graphs
• A note on superbrittle graphs
• Welsh-Powell opposition graphs
• Title not available (Why is that?)
• Some classes of perfectly orderable graphs
• Bipolarizable graphs
• On the complexity of recognizing perfectly orderable graphs
• On the semi-perfect elimination
• Title not available (Why is that?)
• \(P_{4}\)-laden graphs: A new class of brittle graphs
• Title not available (Why is that?)
• On \(P_4\)-transversals of perfect graphs
• On brittle graphs
• Bipartable graphs
• \(P_ 4\)-comparability graphs
• Weak bipolarizable graphs
• Finding houses and holes in graphs
• Generalized neighbourhoods and a class of perfectly orderable graphs
• Quasi-brittle graphs, a new class of perfectly orderable graphs
• On the \(P_ 4\)-structure of perfect graphs. III: Partner decompositions
• A note on perfect orders
• Recognizing brittle graphs: Remarks on a paper of Hoàng and Khouzam
• Title not available (Why is that?)

Cited In (11)

• On opposition graphs, coalition graphs, and bipartite permutation graphs
• Recognizing Bellman–Ford-Orderable Graphs
• Recognizing quasi-triangulated graphs.
• An \(O(nm)\)-time certifying algorithm for recognizing HHD-free graphs
• Recognition algorithms for orders of small width and graphs of small Dilworth number
• The Recognition of Simple-Triangle Graphs and of Linear-Interval Orders is Polynomial
• Recognizing bipolarizable and \(P _{4}\)-simplicial graphs.
• Characterization and recognition of some opposition and coalition graph classes
• The Recognition of Simple-Triangle Graphs and of Linear-Interval Orders Is Polynomial
• On the recognition of bipolarizable and \(P_4\)-simplicial graphs
• On the complexity of recognizing a class of perfectly orderable graphs

This page was built for publication: Recognition of some perfectly orderable graph classes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1811119)