A characterization of cycle-forced bipartite graphs (Q724892): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q5422499 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On certain polytopes associated with graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on PM-compact bipartite graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A characterization of PM-compact bipartite and near-bipartite graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A CHARACTERIZATION OF PM-COMPACT CLAW-FREE CUBIC GRAPHS / rank
 
Normal rank
Property / cites work
 
Property / cites work: A characterization of PM-compact Hamiltonian bipartite graphs / rank
 
Normal rank

Latest revision as of 05:53, 16 July 2024

scientific article
Language Label Description Also known as
English
A characterization of cycle-forced bipartite graphs
scientific article

    Statements

    A characterization of cycle-forced bipartite graphs (English)
    0 references
    0 references
    0 references
    0 references
    26 July 2018
    0 references
    0 references
    0 references
    0 references
    0 references
    bipartite graph
    0 references
    Hamiltonian graph
    0 references
    perfect matching
    0 references
    cycle-forced graph
    0 references
    0 references