Matches in DBpedia 2014 for { <http://dbpedia.org/resource/Ear_decomposition> ?p ?o }
Showing triples 1 to 37 of
37
with 100 triples per page.
- Ear_decomposition abstract "In graph theory, an ear of an undirected graph G is a path P where the two endpoints of the path may coincide, but where otherwise no repetition of edges or vertices is allowed, so every internal vertex of P has degree two in P. An ear decomposition of an undirected graph G is a partition of its set of edges into a sequence of ears, such that the one or two endpoints of each ear belong to earlier ears in the sequence and such that the internal vertices of each ear do not belong to any earlier ear. Additionally, in most cases the first ear in the sequence must be a cycle. An open ear decomposition or a proper ear decomposition is an ear decomposition in which the two endpoints of each ear after the first are distinct from each other.Ear decompositions may be used to characterize several important graph classes, and as part of efficient graph algorithms. They may also be generalized from graphs to matroids.".
- Ear_decomposition thumbnail Ear_decomposition.png?width=300.
- Ear_decomposition wikiPageExternalLink books?id=unEloQ_sYmkC&pg=PA498.
- Ear_decomposition wikiPageExternalLink backmatter.pdf.
- Ear_decomposition wikiPageID "32183016".
- Ear_decomposition wikiPageRevisionID "605448828".
- Ear_decomposition authorlink "David Eppstein".
- Ear_decomposition authorlink "Hassler Whitney".
- Ear_decomposition authorlink "Herbert Robbins".
- Ear_decomposition authorlink "László Lovász".
- Ear_decomposition first "David".
- Ear_decomposition first "Hassler".
- Ear_decomposition first "Herbert".
- Ear_decomposition first "László".
- Ear_decomposition hasPhotoCollection Ear_decomposition.
- Ear_decomposition last "Eppstein".
- Ear_decomposition last "Lovász".
- Ear_decomposition last "Robbins".
- Ear_decomposition last "Whitney".
- Ear_decomposition year "1932".
- Ear_decomposition year "1939".
- Ear_decomposition year "1972".
- Ear_decomposition year "1992".
- Ear_decomposition subject Category:Graph_theory_objects.
- Ear_decomposition subject Category:Matroid_theory.
- Ear_decomposition type GraphTheoryObjects.
- Ear_decomposition type Object100002684.
- Ear_decomposition type PhysicalEntity100001930.
- Ear_decomposition comment "In graph theory, an ear of an undirected graph G is a path P where the two endpoints of the path may coincide, but where otherwise no repetition of edges or vertices is allowed, so every internal vertex of P has degree two in P.".
- Ear_decomposition label "Ear decomposition".
- Ear_decomposition sameAs m.0h1fp7s.
- Ear_decomposition sameAs Q5325632.
- Ear_decomposition sameAs Q5325632.
- Ear_decomposition sameAs Ear_decomposition.
- Ear_decomposition wasDerivedFrom Ear_decomposition?oldid=605448828.
- Ear_decomposition depiction Ear_decomposition.png.
- Ear_decomposition isPrimaryTopicOf Ear_decomposition.