A characterization of partial directed line graphs (Q2455584): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 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.disc.2007.01.009 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2018341366 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3322122 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3941433 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On some properties of DNA graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph Classes: A Survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: The partial line digraph technique in the design of large interconnection networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some simplified NP-complete graph problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The underlying graph of a line digraph / rank
 
Normal rank

Latest revision as of 11:54, 27 June 2024

scientific article
Language Label Description Also known as
English
A characterization of partial directed line graphs
scientific article

    Statements

    A characterization of partial directed line graphs (English)
    0 references
    0 references
    0 references
    25 October 2007
    0 references
    Line digraphs
    0 references
    line graph completion
    0 references
    recognition algorithm
    0 references
    NP-completeness
    0 references

    Identifiers