A unified approach to recognize squares of split graphs (Q313959): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Probe threshold and probe trivially perfect graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On balanced graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph Classes: A Survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decomposition of balanced matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity aspects of the Helly property: graphs and hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4193514 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Split Graphs Having Dilworth Number Two / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recognizing Powers of Proper Interval, Split, and Chordal Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial time recognition of squares of Ptolemaic graphs and 3-sun-free split graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hardness Results and Efficient Algorithms for Graph Powers / rank
 
Normal rank
Property / cites work
 
Property / cites work: A good characterization of squares of strongly chordal split graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Arboricity, \(h\)-index, and dynamic algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing square roots of trivially perfect and threshold graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing roots of graphs is hard / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4288086 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient graph representations / rank
 
Normal rank
Property / cites work
 
Property / cites work: A New Algorithm for Generating All the Maximal Independent Sets / rank
 
Normal rank

Latest revision as of 13:25, 12 July 2024

scientific article
Language Label Description Also known as
English
A unified approach to recognize squares of split graphs
scientific article

    Statements

    A unified approach to recognize squares of split graphs (English)
    0 references
    0 references
    0 references
    0 references
    12 September 2016
    0 references
    square of graphs
    0 references
    square of split graphs
    0 references

    Identifiers