Spiders can be recognized by counting their legs

DOI10.1007/s11786-015-0233-1zbMath1329.05069DBLPjournals/mics/BerkemerCFHHS15arXiv1411.2105OpenAlexW1600659061WikidataQ56267297 ScholiaQ56267297MaRDI QIDQ904532

Sarah J. Berkemer, Maribel Hernandez-Rosales, Ricardo R. C. Chaves, Adrian Fritz, Peter F. Stadler, Marc Hellmuth

Publication date: 13 January 2016

Published in: Mathematics in Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1411.2105

zbMATH Keywords

spiderdegree sequencephylogeneticscographP4-sparse

Mathematics Subject Classification ID

Applications of graph theory (05C90) Structural characterization of families of graphs (05C75) Vertex degrees (05C07) Other natural sciences (mathematical treatment) (92F99)

Cites Work

• Unnamed Item
• Complexity and parameterized algorithms for cograph editing
• Orthology relations, symbolic ultrametrics, and cographs
• BOUNDED SEARCH TREE ALGORITHMS FOR PARAMETRIZED COGRAPH DELETION: EFFICIENT BRANCHING RULES BY EXPLOITING STRUCTURES OF SPECIAL GRAPH CLASSES
• Cograph Editing: Complexity and Parameterized Algorithms
• A remark on the existence of finite graphs
• P₄-Reducible Graphs-Class of Uniquely Tree-Representable Graphs
• On Realizability of a Set of Integers as Degrees of the Vertices of a Linear Graph. I
• Recognizing $P_4 $-Sparse Graphs in Linear Time

This page was built for publication: Spiders can be recognized by counting their legs