2-split graphs

zbMATH Open0976.05064MaRDI QIDQ2718360

David P. Jacobs, Edward Doyle

Publication date: 2 January 2002

Published in: Congressus Numerantium (Search for Journal in Brave)

zbMATH Keywords

partitionbipartite graphscliqueindependent setsrecognition algorithm2-SAT2-split graphs

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (3)

On class 2 split graphs ⋮ 2-swappable graphs ⋮ Recognizing Perfect 2-Split Graphs

This page was built for publication: 2-split graphs

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