Computing square roots of trivially perfect and threshold graphs (Q2446337): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.dam.2012.12.027 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1965580387 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Large-Girth Roots of Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Uniqueness of graph square roots of girth six / rank
 
Normal rank
Property / cites work
 
Property / cites work: Time bounds for selection / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph Classes: A Survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: A result on the total colouring of powers of cycles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Coloring the square of the Kneser graph \(\mathrm{KG}(2k+1,k)\) and the Schrijver graph \(\mathrm{SG}(2k+2,k)\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4165164 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2747613 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complement reducible graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: List-Coloring Squares of Sparse Subcubic Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hamiltonian cycles in the square of a graph / 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: Q4193514 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Trivially perfect graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithmic graph theory and perfect graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The NLC-width and clique-width for powers of graphs of bounded tree-width / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4120519 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3741636 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3575460 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Coloring Powers of Chordal 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: On uniquely intersectable graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3035328 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing roots of graphs is hard / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithmic Aspects of Vertex Elimination on Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the fractional intersection number of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a property of the class of n-colorable graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On powers of graphs of bounded NLC-width (clique-width) / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Comparability Graph of a Tree / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Note on "The Comparability Graph of a Tree" / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5387660 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nowhere-zero 3-flows in squares of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quasi-threshold graphs / rank
 
Normal rank

Latest revision as of 10:44, 8 July 2024

scientific article
Language Label Description Also known as
English
Computing square roots of trivially perfect and threshold graphs
scientific article

    Statements

    Computing square roots of trivially perfect and threshold graphs (English)
    0 references
    0 references
    0 references
    16 April 2014
    0 references
    0 references
    0 references
    0 references
    0 references
    square of a graph
    0 references
    square root of a graph
    0 references
    chordal graph
    0 references
    split graph
    0 references
    trivially perfect graph
    0 references
    threshold graph
    0 references
    linear-time algorithm
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references