Browse using
OpenLink Faceted Browser
OpenLink Structured Data Editor
LodLive Browser
Formats
RDF:
N-Triples
N3
Turtle
JSON
XML
OData:
Atom
JSON
Microdata:
JSON
HTML
Embedded:
JSON
Turtle
Other:
CSV
JSON-LD
Faceted Browser
Sparql Endpoint
About:
Forbidden graph characterization
An Entity of Type:
Thing
,
from Named Graph:
http://dbpedia.org
,
within Data Space:
dbpedia-live.demo.openlinksw.com
Describing a family of graphs by excluding certain (sub)graphs
Property
Value
dbo:
description
matematikai fogalom a gráfelméletben
(hu)
describir una familia de grafos excluyendo ciertos (sub)grafos
(es)
метод опису сімейства графів або гіперграфів
(uk)
describing a family of graphs by excluding certain (sub)graphs
(en)
dbo:
thumbnail
wiki-commons
:Special:FilePath/Simple_bipartite_graph;_two_layers.svg?width=300
dbo:
wikiPageExternalLink
https://books.google.com/books%3Fid=04YbQF8oscQC&lpg=PA327&pg=PA107
https://books.google.com/books%3Fid=04YbQF8oscQC&lpg=PA327&pg=PA327
https://books.google.com/books%3Fid=NvRXJSl9hUUC&pg=RA1-PA275&vq=forbidden&dq=%22hereditary+property%22+forbidden
dbo:
wikiPageWikiLink
dbr
:Matroid_minor
dbr
:Forest_(graph_theory)
dbr
:Glossary_of_graph_theory
dbc
:Graph_minor_theory
dbr
:Cycle_(graph_theory)
dbr
:Spectral_radius
dbr
:Pentagonal_prism
dbr
:Dual_graph
dbc
:Graph_theory
dbr
:Petersen_family
dbr
:Edge_contraction
dbr
:If_and_only_if
dbr
:Forbidden_subgraph_problem
dbr
:Claw-free_graph
dbr
:Line_graph_of_a_hypergraph
dbr
:Linkless_embedding
dbr
:Complement_graph
dbr
:Split_graph
dbc
:Hypergraphs
dbr
:Chordal_graph
dbr
:Cube
dbr
:Kuratowski's_theorem
dbr
:Graph_genus
dbr
:Algorithm
dbr
:Graph_theory
dbr
:Bipartite_graph
dbr
:Hypergraph
dbr
:Characterization_(mathematics)
dbr
:Cograph
dbr
:Ladder_graph
dbr
:Induced_subgraph
dbr
:Octahedron
dbr
:Robertson–Seymour_theorem
dbr
:Complete_graph
dbr
:Complete_bipartite_graph
dbr
:Graph_minor
dbr
:Diamond_graph
dbr
:Outerplanar_graph
dbr
:Wagner_graph
dbr
:Cactus_graph
dbr
:Branchwidth
dbr
:Apex_graph
dbr
:Line_graph
dbr
:Treewidth
dbr
:Zarankiewicz_problem
dbr
:Wagner's_theorem
dbr
:Graph_(discrete_mathematics)
dbc
:Graph_families
dbr
:Planar_graph
dbr
:Homeomorphism_(graph_theory)
dbr
:Threshold_graph
dbr
:Comparability_graph
dbr
:Triangle-free_graph
dbr
:Trivially_perfect_graph
dbr
:Perfect_graph
dbr
:1-planar_graph
dbr
:Star_(graph_theory)
dbr
:Linear_forest
dbr
:Erdős–Hajnal_conjecture
dbr
:Series–parallel_graph
dbr
:Polynomial_time
dbr
:Graph_homeomorphism
dbr
:Graph_union
dbr
:Age_restrictions
dbr
:Induced-hereditary_property
dbr
:Minor-hereditary_property
dbr
:Topological_minor
dbp:
wikiPageUsesTemplate
dbt
:Reflist
dbt
:Math
dbt
:Sub
dbt
:Nbsp
dbt
:Redirect-synonym
dbt
:Harvtxt
dbt
:Short_description
dct:
subject
dbc
:Graph_minor_theory
dbc
:Graph_theory
dbc
:Hypergraphs
dbc
:Graph_families
rdfs:
label
Forbidden graph characterization
(en)
Caracterización de grafos prohibidos
(es)
Характеризация запрещёнными графами
(ru)
Характеризація забороненими графами
(uk)
owl:
sameAs
yago-res
:Forbidden graph characterization
freebase
:Forbidden graph characterization
wikidata
:Forbidden graph characterization
dbpedia-es
:Forbidden graph characterization
dbpedia-hu
:Forbidden graph characterization
dbpedia-ru
:Forbidden graph characterization
dbpedia-uk
:Forbidden graph characterization
dbpedia-global
:Forbidden graph characterization
dbr
:Forbidden graph characterization
prov:
wasDerivedFrom
wikipedia-en
:Forbidden_graph_characterization?oldid=1285952331&ns=0
foaf:
depiction
wiki-commons
:Special:FilePath/Simple_bipartite_graph;_two_layers.svg
foaf:
isPrimaryTopicOf
wikipedia-en
:Forbidden_graph_characterization
is
dbo:
wikiPageRedirects
of
dbr
:Forbidden_graph
dbr
:Forbidden_induced_subgraph
dbr
:Forbidden_minor
dbr
:Forbidden_minor_characterization
dbr
:Forbidden_minors
is
dbo:
wikiPageWikiLink
of
dbr
:Glossary_of_graph_theory
dbr
:Hadwiger_conjecture_(graph_theory)
dbr
:List_coloring
dbr
:Unit_distance_graph
dbr
:Perfect_graph_theorem
dbr
:List_of_graphs
dbr
:Forbidden_subgraph_problem
dbr
:Covering_graph
dbr
:Hadwiger_number
dbr
:Pathwidth
dbr
:Linkless_embedding
dbr
:Kuratowski's_theorem
dbr
:Implicit_graph
dbr
:Graph_theory
dbr
:Bipartite_graph
dbr
:Fulkerson_Prize
dbr
:Cograph
dbr
:Klaus_Wagner
dbr
:Obstruction
dbr
:Robertson–Seymour_theorem
dbr
:Graph_minor
dbr
:Linking_number
dbr
:Dominating_set
dbr
:Outerplanar_graph
dbr
:Toroidal_graph
dbr
:Tree-depth
dbr
:Branch-decomposition
dbr
:Apex_graph
dbr
:Apollonian_network
dbr
:Distance-hereditary_graph
dbr
:Strongly_chordal_graph
dbr
:Line_graph
dbr
:Treewidth
dbr
:L._W._Beineke
dbr
:Zarankiewicz_problem
dbr
:Squaregraph
dbr
:Wagner's_theorem
dbr
:Cayley_configuration_space
dbr
:Planar_graph
dbr
:Threshold_graph
dbr
:Trémaux_tree
dbr
:Knot_(mathematics)
dbr
:Perfect_graph
dbr
:Block_graph
dbr
:Cycle_basis
dbr
:Biclique-free_graph
dbr
:Chordal_bipartite_graph
dbr
:Prism_graph
dbr
:Planar_cover
dbr
:Erdős–Hajnal_conjecture
dbr
:Separable_permutation
dbr
:Strong_perfect_graph_theorem
dbr
:Twin-width
dbr
:Forbidden_graph
dbr
:Forbidden_induced_subgraph
dbr
:Forbidden_minor
dbr
:Forbidden_minor_characterization
dbr
:Forbidden_minors
is
foaf:
primaryTopic
of
wikipedia-en
:Forbidden_graph_characterization
This content was extracted from
Wikipedia
and is licensed under the
Creative Commons Attribution-ShareAlike 4.0 International