Bisplit graphs

DOI10.1016/j.disc.2004.08.046zbMath1073.05059WikidataQ56288395 ScholiaQ56288395MaRDI QIDQ2568470

Andreas Brandstädt, Van Bang Le, Peter L. Hammer, Vadim V. Lozin

Publication date: 10 October 2005

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

Full work available at URL: https://doi.org/10.1016/j.disc.2004.08.046

zbMATH Keywords

split graphs; comparability graphs; induced subgraph characterization

Mathematics Subject Classification ID

05C75: Structural characterization of families of graphs

05C85: Graph algorithms (graph-theoretic aspects)

Related Items

Between 2- and 3-colorability, Polar graphs and maximal independent sets, A forbidden subgraph characterization of line-polar bipartite graphs, A note on the recognition of bisplit graphs, Graph partitions with prescribed patterns, Edge vulnerability parameters of bisplit graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Coloring graphs with stable cutsets
• Some simplified NP-complete graph problems
• A linear-time algorithm for testing the truth of certain quantified Boolean formulas
• The complexity of some problems related to GRAPH 3-COLORABILITY
• Modular decomposition and transitive orientation
• Stable set bonding in perfect graphs and parity graphs
• On \(P_4\)-transversals of perfect graphs
• On stable cutsets in graphs
• Recognizing decomposable graphs
• On the Complexity of Timetable and Multicommodity Flow Problems
• List Partitions
• Transitiv orientierbare Graphen