scientific article; zbMATH DE number 742981
From MaRDI portal
Publication:4763420
zbMath0822.05025MaRDI QIDQ4763420
André E. Kézdy, Patrick J. McGuinness
Publication date: 11 April 1995
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Planar graphs; geometric and topological aspects of graph theory (05C10) Connectivity (05C40) Distributed algorithms (68W15)
Related Items
Dynamic coloring of graphs having no \(K_5\) minor, Approximation algorithms for classes of graphs excluding single-crossing graphs as minors, On even circuit decompositions of eulerian graphs, Efficient algorithms for acyclic colorings of graphs, Optimization and Recognition for K 5-minor Free Graphs in Linear Time, Structure and recognition of graphs with no 6-wheel subdivision, Tight upper bound on the number of edges in a bipartite \(K_{3,3}\)-free or \(K_{5}\)-free graph with an application.
