Recognizing the \(P_4\)-structure of bipartite graphs (Q1296570): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Q4373667 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the \(p\)-connectedness of graphs---a survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3222224 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recognizing the \(P_ 4\)-structures of a tree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4828957 / rank
 
Normal rank
Property / cites work
 
Property / cites work: P-Components and the Homogeneous Decomposition of Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A semi-strong perfect graph theorem / rank
 
Normal rank

Revision as of 20:24, 28 May 2024

scientific article
Language Label Description Also known as
English
Recognizing the \(P_4\)-structure of bipartite graphs
scientific article

    Statements

    Recognizing the \(P_4\)-structure of bipartite graphs (English)
    0 references
    0 references
    0 references
    0 references
    2 August 1999
    0 references
    \(P_4\)-structure
    0 references
    bipartite graph
    0 references

    Identifiers