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:
Graph theory objects
An Entity of Type:
Concept
,
from Named Graph:
http://dbpedia.org
,
within Data Space:
dbpedia.org
Property
Value
dbo:
wikiPageID
26304777
(xsd:integer)
dbo:
wikiPageRevisionID
618781904
(xsd:integer)
rdf:
type
skos
:Concept
rdfs:
label
Graph theory objects
(en)
skos:
broader
dbc
:Graph_theory
skos:
prefLabel
Graph theory objects
(en)
prov:
wasDerivedFrom
wikipedia-en
:Category:Graph_theory_objects?oldid=618781904&ns=14
is
dbo:
wikiPageWikiLink
of
dbr
:End_(graph_theory)
dbr
:Cycle_(graph_theory)
dbr
:Cycle_double_cover
dbr
:Ear_decomposition
dbr
:Incidence_(graph)
dbr
:Independent_set_(graph_theory)
dbr
:Induced_matching
dbr
:Induced_path
dbr
:Induced_subgraph
dbr
:Level_structure
dbr
:Pseudoforest
dbr
:Weak_component
dbr
:(a,_b)-decomposition
dbr
:Maximal_independent_set
dbr
:Maximum_cut
dbr
:Neighbourhood_(graph_theory)
dbr
:Odd_cycle_transversal
dbr
:Orientation_(graph_theory)
dbr
:Skew_partition
dbr
:Friendly-index_set
dbr
:Graph_minor
dbr
:Bramble_(graph_theory)
dbr
:Core_(graph_theory)
dbr
:Chordal_completion
dbr
:Clique_(graph_theory)
dbr
:Clique_cover
dbr
:Component_(graph_theory)
dbr
:Feedback_arc_set
dbr
:Hamiltonian_decomposition
dbr
:Path_(graph_theory)
dbr
:Split_(graph_theory)
dbr
:Peripheral_cycle
dbr
:Acyclic_orientation
dbr
:Tree_decomposition
dbr
:Minimum_cut
dbr
:Path_cover
dbr
:Trémaux_tree
dbr
:Edge-graceful_labeling
dbr
:Eulerian_path
dbr
:Directed_cycle
dbr
:Graceful_labeling
dbr
:Graph_center
dbr
:Graph_factorization
dbr
:Hamiltonian_path
dbr
:Haven_(graph_theory)
dbr
:Hydra_game
dbr
:Bipolar_orientation
dbr
:Blossom_tree_(graph_theory)
dbr
:Edge_cycle_cover
dbr
:Modular_decomposition
dbr
:Dominating_set
dbr
:Rainbow_matching
dbr
:Map_(graph_theory)
dbr
:Strong_orientation
dbr
:Unique_sink_orientation
dbr
:Eternal_dominating_set
dbr
:Planar_cover
dbr
:Unfriendly_partition
dbr
:Universal_vertex
dbr
:Multiple_edges
dbr
:Nonblocker
dbr
:Pfaffian_orientation
dbr
:Sachs_subgraph
is
dcterms:
subject
of
dbr
:End_(graph_theory)
dbr
:Cycle_(graph_theory)
dbr
:Cycle_double_cover
dbr
:Ear_decomposition
dbr
:Incidence_(graph)
dbr
:Independent_set_(graph_theory)
dbr
:Induced_matching
dbr
:Induced_path
dbr
:Induced_subgraph
dbr
:Level_structure
dbr
:Pseudoforest
dbr
:Weak_component
dbr
:(a,_b)-decomposition
dbr
:Maximal_independent_set
dbr
:Maximum_cut
dbr
:Neighbourhood_(graph_theory)
dbr
:Odd_cycle_transversal
dbr
:Orientation_(graph_theory)
dbr
:Skew_partition
dbr
:Friendly-index_set
dbr
:Graph_minor
dbr
:Bramble_(graph_theory)
dbr
:Core_(graph_theory)
dbr
:Chordal_completion
dbr
:Clique_(graph_theory)
dbr
:Clique_cover
dbr
:Component_(graph_theory)
dbr
:Feedback_arc_set
dbr
:Hamiltonian_decomposition
dbr
:Path_(graph_theory)
dbr
:Split_(graph_theory)
dbr
:Peripheral_cycle
dbr
:Acyclic_orientation
dbr
:Tree_decomposition
dbr
:Minimum_cut
dbr
:Path_cover
dbr
:Trémaux_tree
dbr
:Edge-graceful_labeling
dbr
:Eulerian_path
dbr
:Directed_cycle
dbr
:Graceful_labeling
dbr
:Graph_center
dbr
:Graph_factorization
dbr
:Hamiltonian_path
dbr
:Haven_(graph_theory)
dbr
:Hydra_game
dbr
:Bipolar_orientation
dbr
:Blossom_tree_(graph_theory)
dbr
:Edge_cycle_cover
dbr
:Modular_decomposition
dbr
:Dominating_set
dbr
:Rainbow_matching
dbr
:Map_(graph_theory)
dbr
:Strong_orientation
dbr
:Unique_sink_orientation
dbr
:Eternal_dominating_set
dbr
:Planar_cover
dbr
:Unfriendly_partition
dbr
:Universal_vertex
dbr
:Multiple_edges
dbr
:Nonblocker
dbr
:Pfaffian_orientation
dbr
:Sachs_subgraph
is
skos:
broader
of
dbc
:Spanning_tree
dbc
:Hamiltonian_paths_and_cycles
This content was extracted from
Wikipedia
and is licensed under the
Creative Commons Attribution-ShareAlike 3.0 Unported License