Anticoloring and separation of graphs (Q960942): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Planar Separators / rank
 
Normal rank
Property / cites work
 
Property / cites work: Anticoloring of a family of grid graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3737448 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3717092 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reduced constants for simple cycle graph separation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Regular line-symmetric graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Separator Theorem for Chordal Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Splitting trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: An infinite series of regular edge- but not vertex-transitive graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Separator Theorem for Planar Graphs / rank
 
Normal rank

Latest revision as of 15:47, 2 July 2024

scientific article
Language Label Description Also known as
English
Anticoloring and separation of graphs
scientific article

    Statements

    Anticoloring and separation of graphs (English)
    0 references
    29 March 2010
    0 references
    0 references
    disconnected graph
    0 references
    algorithm
    0 references
    combinatorial optimization
    0 references
    graph anticoloring
    0 references
    separation
    0 references
    planar graph
    0 references
    0 references
    0 references
    0 references
    0 references