Clique covering and clique partition in generalizations of line graphs (Q1343162): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new 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 / cites work
 
Property / cites work: The NP-Completeness of Some Edge-Partition Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4152571 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Property of Infinite Products of Boolean Matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Clique Covering of Graphs IV. Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Applications of edge coverings by cliques / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the tree representation of chordal graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A New Algorithm for Generating All the Maximal Independent Sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: On clique partitions of split graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3980562 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 10:38, 23 May 2024

scientific article
Language Label Description Also known as
English
Clique covering and clique partition in generalizations of line graphs
scientific article

    Statements

    Clique covering and clique partition in generalizations of line graphs (English)
    0 references
    0 references
    1 February 1995
    0 references
    clique partition
    0 references
    cliques covering
    0 references
    line graphs
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references