Characterization of even directed graphs (Q1085177): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Cycles in digraphs– a survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: The directed subgraph homeomorphism problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Signsolvability revisited / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Solution of the Shannon Switching Game / rank
 
Normal rank
Property / cites work
 
Property / cites work: On digraphs with the odd cycle property / rank
 
Normal rank
Property / cites work
 
Property / cites work: ON THE TWO-COLOURING OF HYPERGRAPHS / rank
 
Normal rank
Property / cites work
 
Property / cites work: The 2-linkage problem for acyclic digraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sign-nonsingular matrices and even cycles in directed graphs / rank
 
Normal rank

Revision as of 16:48, 17 June 2024

scientific article
Language Label Description Also known as
English
Characterization of even directed graphs
scientific article

    Statements

    Characterization of even directed graphs (English)
    0 references
    0 references
    0 references
    1987
    0 references
    The authors give a structural characterization of directed graphs D with the property that every subdivision of D contains a cycle of even length.
    0 references
    even cycles
    0 references
    cycle bases
    0 references
    directed graphs
    0 references
    0 references

    Identifiers