Probe threshold and probe trivially perfect graphs (Q1034600): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new 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 / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.tcs.2009.06.029 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2038410225 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A linear-time algorithm for testing the truth of certain quantified Boolean formulas / rank
 
Normal rank
Property / cites work
 
Property / cites work: Threshold characterization of graphs with dilworth number two / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recognizing Chordal Probe Graphs and Cycle-Bicolorable Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Theory and Applications of Models of Computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Partitioned probe comparability graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recognition of Probe Cographs and Partitioned Probe Distance Hereditary Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing and Combinatorics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4165164 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4954442 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient and Practical Algorithms for Sequential Modular Decomposition / rank
 
Normal rank
Property / cites work
 
Property / cites work: Trivially perfect graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Chordal probe graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bithreshold Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Difference graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Characterisations and Linear-Time Recognition of Probe Cographs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5387698 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Strict 2-threshold graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Threshold graphs and related topics / 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: Quasi-threshold graphs / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 03:59, 2 July 2024

scientific article
Language Label Description Also known as
English
Probe threshold and probe trivially perfect graphs
scientific article

    Statements

    Probe threshold and probe trivially perfect graphs (English)
    0 references
    0 references
    0 references
    0 references
    6 November 2009
    0 references
    probe graphs
    0 references
    probe threshold
    0 references
    probe interval
    0 references
    probe trivially perfect
    0 references
    graph class
    0 references
    2-SAT
    0 references

    Identifiers