Spiders can be recognized by counting their legs (Q904532): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Created claim: DBLP publication ID (P1635): journals/mics/BerkemerCFHHS15, #quickstatements; #temporary_batch_1731547958265
 
(3 intermediate revisions by 3 users not shown)
Property / OpenAlex ID
 
Property / OpenAlex ID: W1600659061 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1411.2105 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3287781 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Realizability of a Set of Integers as Degrees of the Vertices of a Linear Graph. I / rank
 
Normal rank
Property / cites work
 
Property / cites work: A remark on the existence of finite graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Orthology relations, symbolic ultrametrics, and cographs / rank
 
Normal rank
Property / cites work
 
Property / cites work: <i>P</i><sub>4</sub>-Reducible Graphs-Class of Uniquely Tree-Representable Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recognizing $P_4 $-Sparse Graphs in Linear Time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cograph Editing: Complexity and Parameterized Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity and parameterized algorithms for cograph editing / rank
 
Normal rank
Property / cites work
 
Property / cites work: BOUNDED SEARCH TREE ALGORITHMS FOR PARAMETRIZED COGRAPH DELETION: EFFICIENT BRANCHING RULES BY EXPLOITING STRUCTURES OF SPECIAL GRAPH CLASSES / rank
 
Normal rank
Property / DBLP publication ID
 
Property / DBLP publication ID: journals/mics/BerkemerCFHHS15 / rank
 
Normal rank

Latest revision as of 02:43, 14 November 2024

scientific article
Language Label Description Also known as
English
Spiders can be recognized by counting their legs
scientific article

    Statements

    Identifiers