On the thinness and proper thinness of a graph (Q2414456): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(6 intermediate revisions by 5 users not shown)
Property / author
 
Property / author: Flavia Bonomo-Braberman / rank
Normal rank
 
Property / author
 
Property / author: Flavia Bonomo-Braberman / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2604999769 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1704.00379 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nonserial dynamic programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounds on isoperimetric values of trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Restrictions of graph partition problems. I / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounded coloring of co-comparability graphs and the pickup and delivery tour combination problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the 2-rainbow domination in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On counting interval lengths of interval graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The stable set problem and the thinness of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complement reducible graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Handle-rewriting hypergraph grammars / rank
 
Normal rank
Property / cites work
 
Property / cites work: Upper bounds to the clique width of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear-Time Representation Algorithms for Proper Circular-Arc Graphs and Proper Interval Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The vertex separation and search number of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: List matrix partitions of chordal graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3344239 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of comparability graph recognition and coloring / rank
 
Normal rank
Property / cites work
 
Property / cites work: ON THE CLIQUE-WIDTH OF SOME PERFECT GRAPH CLASSES / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rainbow Domination and Related Problems on Some Classes of Perfect Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The b-chromatic number of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: A width parameter useful for chordal and co-comparability graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Classes of Interval Graphs of Limited Nesting and Count of Lengths / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Interval Count of a Graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Upper and Lower Bounds on the Complexity of the Min-Cut Linear Arrangement Problem on Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4694722 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal greedy algorithms for indifference graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new property of critical imperfect graphs and some consequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: An optimal greedy heuristic to color interval graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4871056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A unified approach to domination problems on interval graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5588432 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5588433 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph minors. I. Excluding a forest / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph minors. II. Algorithmic aspects of tree-width / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3197842 / 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: Graph colorings with local constraints -- a survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on isoperimetric peaks of complete trees / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 06:43, 19 July 2024

scientific article
Language Label Description Also known as
English
On the thinness and proper thinness of a graph
scientific article

    Statements

    On the thinness and proper thinness of a graph (English)
    0 references
    0 references
    17 May 2019
    0 references
    interval graphs
    0 references
    proper interval graphs
    0 references
    proper thinness
    0 references
    thinness
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers