The competition numbers of complete tripartite graphs (Q1003747): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
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.2008.04.009 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1977736648 / 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: Q4171826 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Applications of edge coverings by cliques / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 03:37, 29 June 2024

scientific article
Language Label Description Also known as
English
The competition numbers of complete tripartite graphs
scientific article

    Statements

    The competition numbers of complete tripartite graphs (English)
    0 references
    0 references
    0 references
    4 March 2009
    0 references
    0 references
    competition graph
    0 references
    competition number
    0 references
    complete tripartite graph
    0 references
    0 references