On two variants of split graphs: 2-unipolar graph and k-probe-split graph

DOI10.1051/RO/2023149MaRDI QIDQ6658477FDOQ6658477

Authors: Luciano N. Grippo, Veronica A. Moyano 

Publication date: 8 January 2025

Published in: RAIRO. Operations Research (Search for Journal in Brave)

Recommendations

• Minimal obstructions to 2-polar cographs
• Polar cographs
• Probe split graphs
• Recognition of unipolar and generalised split graphs

zbMATH Keywords

split-width\(k\)-probe-split graph2-unipolar graph

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Structural characterization of families of graphs (05C75)

Cites Work

• Complement reducible graphs
• Algorithmic graph theory and perfect graphs
• Title not available (Why is that?)
• Trivially perfect graphs
• The splittance of a graph
• Quasi-threshold graphs
• Characterizing intersection graphs of substars of a star.
• Title not available (Why is that?)
• Polar cographs
• Polarity of chordal graphs
• Block-graph width
• Algorithms for unipolar and generalized split graphs
• Complexity and algorithms for recognizing polar and monopolar graphs
• Minimal obstructions to \(( s , 1 )\)-polarity in cographs
• Minimal obstructions to 2-polar cographs
• Block-Graph Width

This page was built for publication: On two variants of split graphs: 2-unipolar graph and \(k\)-probe-split graph

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