Compressed cliques graphs, clique coverings and positive zero forcing (Q2636506): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2963996369 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1508.07357 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Zero forcing sets and the minimum rank of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameters Related to Tree‐Width, Zero Forcing, and Maximum Nullity of a Graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Zero forcing parameters and minimum rank problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Known Algorithms for Edge Clique Cover are Probably Optimal / rank
 
Normal rank
Property / cites work
 
Property / cites work: Handbook of Graph Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Positive semidefinite zero forcing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Note on positive semidefinite maximum nullity and positive semidefinite zero forcing number of partial 2-trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of the positive semidefinite zero forcing number / rank
 
Normal rank
Property / cites work
 
Property / cites work: Line graphs: Their maximum nullities and zero forcing numbers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Claw-free graphs---a survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Data reduction and exact algorithms for clique cover / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3309876 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Positive semidefinite propagation time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast-mixed searching and related problems on graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower bounds for positive semidefinite zero forcing and their applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: A New Lower Bound for Positive Zero Forcing / rank
 
Normal rank

Latest revision as of 19:23, 15 July 2024

scientific article
Language Label Description Also known as
English
Compressed cliques graphs, clique coverings and positive zero forcing
scientific article

    Statements

    Compressed cliques graphs, clique coverings and positive zero forcing (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    5 June 2018
    0 references
    positive zero forcing number
    0 references
    cliques
    0 references
    clique cover number
    0 references
    compressed cliques graph
    0 references
    Johnson graph
    0 references
    forbidden subgraphs
    0 references

    Identifiers