Two counterexamples on completely independent spanning trees
Copyright policy )Two counterexamples on completely independent spanning trees
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
- Eötvös Loránd University Hungary
Tutte graph, plane graphs, Interconnection networks, Independent spanning trees, Trees, Planar graphs; geometric and topological aspects of graph theory, Theoretical Computer Science, Plane graphs, Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.), Discrete Mathematics and Combinatorics, independent spanning trees, interconnection networks
Tutte graph, plane graphs, Interconnection networks, Independent spanning trees, Trees, Planar graphs; geometric and topological aspects of graph theory, Theoretical Computer Science, Plane graphs, Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.), Discrete Mathematics and Combinatorics, independent spanning trees, interconnection networks
selected citations These citations are derived from selected sources.This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).57 popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.Top 10% influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).Top 10% impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.Top 10%
Citations provided by BIP!Popularity provided by BIP!