Edge sets contained in circuits (Q1229230): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claim: author (P16): Item:Q201981
Set OpenAlex properties.
 
(3 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: K. Brooks Reid / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cycles of Each Length in Regular Tournaments / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bypasses in asymmetric digraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Randomly Traceable Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graphs in which every finite path is contained in a circuit / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5572939 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on K-path hamiltonian graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5585195 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5589881 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Arc coverings of graphs / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/bf02834761 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2066375675 / rank
 
Normal rank

Latest revision as of 11:45, 30 July 2024

scientific article
Language Label Description Also known as
English
Edge sets contained in circuits
scientific article

    Statements