Edge clique partition in \((k,\ell)\)-graphs (Q2243139): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an 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.2021.09.035 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W3208537703 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the hardness of recognizing triangular line graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A partial k-arboretum of graphs with bounded treewidth / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of some problems related to GRAPH 3-COLORABILITY / rank
 
Normal rank
Property / cites work
 
Property / cites work: Characterization and recognition of \(P_{4}\)-sparse graphs partitionable into \(k\) independent sets and \(\ell \) cliques / rank
 
Normal rank
Property / cites work
 
Property / cites work: On decision and optimization (\(k\),\(l\))-graph sandwich problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for Minimum Coloring, Maximum Clique, Minimum Covering by Cliques, and Maximum Independent Set of a Chordal Graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3328583 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Partitioning chordal graphs into independent sets and cliques / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4016827 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Computational Complexity of Combinatorial Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Induced cycles in triangle graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3773908 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4734765 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4152571 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Characterizing and edge-colouring split-indifference graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3309876 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Clique Covering of Graphs IV. Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: On simple characterizations of k-trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: On clique partitions of split graphs / rank
 
Normal rank

Latest revision as of 03:42, 27 July 2024

scientific article
Language Label Description Also known as
English
Edge clique partition in \((k,\ell)\)-graphs
scientific article

    Statements

    Edge clique partition in \((k,\ell)\)-graphs (English)
    0 references
    0 references
    0 references
    0 references
    11 November 2021
    0 references
    0 references
    0 references
    0 references
    0 references
    \((k,\ell)\)-graphs
    0 references
    split-indifference graphs
    0 references
    partial 2-trees
    0 references
    triangular grids
    0 references
    0 references