A characterization of line graphs that are squares of graphs (Q400504): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Large-Girth Roots of Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dominating cliques in \(P_ 5\)-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distance-hereditary graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Characterizations of derived graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph Classes: A Survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Structure and linear-time recognition of 4-leaf powers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of finding graph roots with girth conditions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graphs of diameter 3 with the minimum number of edges / rank
 
Normal rank
Property / cites work
 
Property / cites work: On metric properties of certain clique graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bipartite roots of graphs / 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: Hardness Results and Efficient Algorithms for Graph Powers / rank
 
Normal rank
Property / cites work
 
Property / cites work: The square of a block graph / 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: Powers of cycles, powers of paths, and distance graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for Square Roots of Graphs / 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: A \(max \{m, n \}\) algorithm for determining the graph H from its line graph G / rank
 
Normal rank

Latest revision as of 22:59, 8 July 2024

scientific article
Language Label Description Also known as
English
A characterization of line graphs that are squares of graphs
scientific article

    Statements

    A characterization of line graphs that are squares of graphs (English)
    0 references
    0 references
    0 references
    0 references
    22 August 2014
    0 references
    0 references
    0 references
    0 references
    0 references
    the square of a graph
    0 references
    line graph
    0 references
    linear time algorithm
    0 references
    0 references