Split dimension of graphs

DOI10.1016/0012-365X(91)90394-HzbMath0764.05072MaRDI QIDQ1176734

A. A. Chernyak, Zhanna A. Chernyak

Publication date: 25 June 1992

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

zbMATH Keywords

graph split coverssplit dimension

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Extremal problems in graph theory (05C35) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items

Matchings, coverings, and Castelnuovo-Mumford regularity, On split-coloring problems

Cites Work

• Unnamed Item
• Unnamed Item
• The splittance of a graph
• Simple separable graphs
• The Complexity of the Partial Order Dimension Problem
• Sufficient Conditions for Graphs to Have Threshold Number 2
• A New Algorithm for Generating All the Maximal Independent Sets