On the Polarity and Monopolarity of Graphs (Q5418774): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: About recognizing (\(\alpha\) ,\(\beta\) ) classes of polar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Line-Polar Graphs: Characterization and Recognition / rank
 
Normal rank
Property / cites work
 
Property / cites work: List monopolar partitions of claw-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving partition problems with colour-bipartitions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polarity of chordal graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recognizing line-polar bipartite graphs in time \(O(n)\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polar cographs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Vertex-partitioning into fixed additive induced-hereditary properties is NP-hard / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3328583 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A forbidden subgraph characterization of line-polar bipartite graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3734451 / rank
 
Normal rank

Latest revision as of 13:03, 8 July 2024

scientific article; zbMATH DE number 6298853
Language Label Description Also known as
English
On the Polarity and Monopolarity of Graphs
scientific article; zbMATH DE number 6298853

    Statements

    On the Polarity and Monopolarity of Graphs (English)
    0 references
    0 references
    0 references
    28 May 2014
    0 references
    polar graph
    0 references
    monopolar graph
    0 references
    triangle-free graph
    0 references
    claw-free graph
    0 references
    NP-completeness
    0 references
    characterization
    0 references
    polynomial time algorithm
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references