Results 281 to 290 of about 1,862,441 (301)
Some of the next articles are maybe not open access.
On the Hyperbolicity Constant in Graph Minors
Bulletin of the Iranian Mathematical Society, 2018zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Walter Carballosa +3 more
openaire +1 more source
Graph Minors. II. Algorithmic Aspects of Tree-Width
J. Algorithms, 1986N. Robertson, P. Seymour
semanticscholar +1 more source
Compact topological minors in graphs
Journal of Graph Theory, 2010Summary: Let \(\varepsilon \) be a real number such that \(0 < \varepsilon < \frac{1}{2}\) and \(t\) a positive integer. Let \(n\) be a sufficiently large positive integer as a function of \(t\) and \(\varepsilon \). We show that every \(n\)-vertex graph with at least \(n^{1+\varepsilon }\) edges contains a subdivision of \(K_{t}\) in which each edge ...
openaire +2 more sources
On fixing edges in graph minors
Graphs and Combinatorics, 1996A characterization of graphs with certain minor-type property is given.
openaire +1 more source
Graph Minors from Simulated Annealing for Annealing Machines with Sparse Connectivity
International Conference on Theory and Practice of Natural Computing, 2018Y. Sugie +9 more
semanticscholar +1 more source
A characterization of graphs with no octahedron minor
J. Graph Theory, 2013Summary: It is proved that a graph does not contain an octahedron minor if and only if it is constructed from \(\{ K_1, K_2, K_3, K_4\} \cup \{C_{2n-1}^2 : n\geq 3\}\) and five other internally 4-connected graphs by 0-, 1-, 2-, and 3-sums.
openaire +1 more source
Graph states and the variety of principal minors
Annali Di Matematica Pura Ed Applicata, 2023Vincenzo Galgano +2 more
exaly
Constructive results from graph minors: linkless embeddings
[Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science, 1988R. Motwani, A. Raghunathan, H. Saran
semanticscholar +1 more source
Minimum Degree and Graph Minors
Electronic Notes in Discrete Mathematics, 2008Gasper Fijavz, David R Wood
exaly