Long cycles in bipartite graphs (Q1059086): 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/0095-8956(85)90077-2 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1981693422 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3963042 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3941433 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3097395 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some Theorems on Abstract Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cycles in bipartite graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5588437 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5342985 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4141844 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximal circuits of graphs. I / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 17:53, 14 June 2024

scientific article
Language Label Description Also known as
English
Long cycles in bipartite graphs
scientific article

    Statements

    Long cycles in bipartite graphs (English)
    0 references
    0 references
    1985
    0 references
    See the preview in Zbl 0549.05037.
    0 references
    0 references
    2-connected bipartite graph
    0 references
    length
    0 references
    long cycles
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references