On split-coloring problems (Q995923): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Split graphs of Dilworth number 2 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of some problems related to GRAPH 3-COLORABILITY / rank
 
Normal rank
Property / cites work
 
Property / cites work: Split dimension of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A hypocoloring model for batch scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: On rigid circuit graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Incidence matrices and interval graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for Minimum Coloring, Maximum Clique, Minimum Covering by Cliques, and Maximum Independent Set of a Chordal Graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3147665 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The splittance of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Partitioning chordal graphs into independent sets and cliques / rank
 
Normal rank
Property / cites work
 
Property / cites work: Threshold graphs and related topics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Depth-First Search and Linear Graph Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Addendum: Simple Linear-Time Algorithms to Test Chordality of Graphs, Test Acyclicity of Hypergraphs, and Selectively Reduce Acyclic Hypergraphs / rank
 
Normal rank

Revision as of 14:13, 26 June 2024

scientific article
Language Label Description Also known as
English
On split-coloring problems
scientific article

    Statements

    Identifiers