A note on the bichromatic numbers of graphs (Q3061187): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: The maximum edit distance from hereditary graph properties / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the editing distance of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complement reducible graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Characterizing –partitionable Cographs / 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: Q4175304 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Excluding induced subgraphs. II: Extremal graphs / rank
 
Normal rank

Revision as of 13:16, 3 July 2024

scientific article
Language Label Description Also known as
English
A note on the bichromatic numbers of graphs
scientific article

    Statements

    A note on the bichromatic numbers of graphs (English)
    0 references
    0 references
    0 references
    14 December 2010
    0 references
    graph partition
    0 references
    bichromatic number (binary chromatic number)
    0 references
    cograph
    0 references
    computation
    0 references
    characterization
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references