Characterizations of competition multigraphs (Q967349): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Import241208061232 (talk | contribs)
Normalize DOI.
 
(4 intermediate revisions by 4 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.dam.2009.04.010 / rank
Normal rank
 
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.dam.2009.04.010 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2072903017 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4712024 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A characterization of competition graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Computation of the Competition Number of a Graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3689222 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4171826 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A characterization of competition graphs of arbitrary digraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Competition hypergraphs / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.DAM.2009.04.010 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 10:26, 10 December 2024

scientific article
Language Label Description Also known as
English
Characterizations of competition multigraphs
scientific article

    Statements

    Characterizations of competition multigraphs (English)
    0 references
    0 references
    28 April 2010
    0 references
    competition graph
    0 references
    competition multigraph
    0 references
    competition hypergraph
    0 references
    multicompetition number
    0 references
    edge clique partition
    0 references
    arbitraru digraphs
    0 references
    loopless digraphs
    0 references

    Identifiers