A Characterization of Graph Properties Testable for General Planar Graphs With One-Sided Error (It's All About Forbidden Subgraphs)

doi 10.1109/focs.2019.00089
Full Text
Abstract

Available in full text

Date
Authors
Publisher

IEEE

Related search

Toughness, Forbidden Subgraphs, and Hamilton-Connected Graphs

Discussiones Mathematicae - Graph Theory
CombinatoricsApplied MathematicsDiscrete Mathematics
2019English

Uniquely Partitionable Planar Graphs With Respect to Properties Having a Forbidden Tree

Discussiones Mathematicae - Graph Theory
CombinatoricsApplied MathematicsDiscrete Mathematics
1999English

Easily Testable Graph Properties

Combinatorics Probability and Computing
StatisticsProbabilityApplied MathematicsMathematicsComputational TheoryTheoretical Computer Science
2015English

Forbidden Structures for Planar Perfect Consecutively Colourable Graphs

Discussiones Mathematicae - Graph Theory
CombinatoricsApplied MathematicsDiscrete Mathematics
2017English

Well-Quasi-Ordering Infinite Graphs With Forbidden Finite Planar Minor

Transactions of the American Mathematical Society
MathematicsApplied Mathematics
1989English

Ramsey-Type Theorems With Forbidden Subgraphs

Combinatorica
CombinatoricsComputational MathematicsDiscrete Mathematics
2001English

It's All About Communication

British Journal of Surgery
Surgery
2018English

It's All About Money

Bulletin of the World Health Organization
EnvironmentalPublic HealthOccupational Health
2009English

It's All About Communication

English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2024 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy