On \((1, 2)\)-step competition graphs of bipartite tournaments (Q2410227): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Import241208061232 (talk | contribs)
Normalize DOI.
 
(5 intermediate revisions by 5 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.dam.2017.08.004 / rank
Normal rank
 
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2963936334 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1611.01901 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Niche graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The \(m\)-step competition graph of a digraph / rank
 
Normal rank
Property / cites work
 
Property / cites work: The (1,2)-step competition graph of a tournament / rank
 
Normal rank
Property / cites work
 
Property / cites work: A sufficient condition for Kim's conjecture on the competition numbers of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A generalization of Opsut's result on the competition numbers of line graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The competition graphs of oriented complete bipartite graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: \(p\)-competition graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Transversals and competition numbers of complete multipartite graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Competition numbers of complete \(r\)-partite graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Competition Numbers, Quasi-line Graphs, and Holes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4375745 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The competition-common enemy graph of a digraph / rank
 
Normal rank
Property / cites work
 
Property / cites work: The \((1, 2)\)-step competition graph of a pure local tournament that is not round decomposable / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2866621 / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.DAM.2017.08.004 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 11:29, 18 December 2024

scientific article
Language Label Description Also known as
English
On \((1, 2)\)-step competition graphs of bipartite tournaments
scientific article

    Statements

    On \((1, 2)\)-step competition graphs of bipartite tournaments (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    17 October 2017
    0 references
    bipartite tournament
    0 references
    orientation of complete bipartite graph
    0 references
    \((1, 2)\)-step competition graphs
    0 references
    \((1, 2)\)-step competition-realizable
    0 references

    Identifiers