Results 261 to 268 of about 28,550 (268)
Some of the next articles are maybe not open access.
Parameterized complexity: exponential speed-up for planar graph problems
Journal of Algorithms, 2004Jochen Alber +2 more
exaly
A sufficient condition for a planar graph to be class 1
Theoretical Computer Science, 2007Weifan Wang
exaly
Every planar graph has an acyclic 7-coloring
Israel Journal of Mathematics, 1977Michael O Albertson, David M Berman
exaly
MTPSO algorithm for solving planar graph coloring problem
Expert Systems With Applications, 2011Shi-Jinn Horng +2 more
exaly
A planar hypohamiltonian graph with 48 vertices
Journal of Graph Theory, 2007Carol T Zamfirescu
exaly
Some sufficient conditions for a planar graph of maximum degree six to be Class 1
Discrete Mathematics, 2006Yuehua Bu, Weifan Wang
exaly
The square of every subcubic planar graph of girth at least 6 is 7-choosable
Discrete MathematicsSeog-Jin Kim, Seog-Jin Kim
exaly