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

DOI10.1051/ro/2023149MaRDI QIDQ6658477

Luciano N. Grippo, Veronica A. Moyano

Publication date: 8 January 2025

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

zbMATH Keywords

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

Mathematics Subject Classification ID

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

Cites Work

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

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)