On well-covered triangulations. II. (Q967322): Difference between revisions

From MaRDI portal
Added link to MaRDI 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.2009.03.014 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2138177131 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Triangles with restricted degree sum of their boundary vertices in plane graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4711490 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3139761 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On well-covered triangulations. I / rank
 
Normal rank
Property / cites work
 
Property / cites work: The uniquely embeddable planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4243055 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Triangles with restricted degrees of their boundary vertices in plane triangulations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4142699 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On maximal independent sets of vertices in claw-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some covering concepts in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: WELL-COVERED GRAPHS: A SURVEY / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity results for well‐covered graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithme de recherche d'un stable de cardinalité maximum dans un graphe sans étoilé / rank
 
Normal rank
Property / cites work
 
Property / cites work: Well-covered claw-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The structure of well-covered graphs and the complexity of their recognition problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: How to Draw a Graph / rank
 
Normal rank

Latest revision as of 18:25, 2 July 2024

scientific article
Language Label Description Also known as
English
On well-covered triangulations. II.
scientific article

    Statements

    Identifiers