Results 291 to 300 of about 1,484,168 (305)
Some of the next articles are maybe not open access.
A bound on the chromatic number of the square of a planar graph
Journal of Combinatorial Theory Series B, 2005Mohammad Salavatipour
exaly
On the number of cycles of length k in a maximal planar graph
Journal of Graph Theory, 1979S. Hakimi, E. Schmeichel
semanticscholar +1 more source
A sufficient condition for a planar graph to be 4-choosable
Discrete Applied Mathematics, 2017Jian-Liang Wu, Renyu Xu
exaly
A sufficient condition for a planar graph to be 3-choosable
Information Processing Letters, 2007Yingqian Wang
exaly
On the pagenumber of planar graphs
Proceedings of the sixteenth annual ACM symposium on Theory of computing - STOC '84, 1984Jonathan F. Buss, Peter W. Shor
openaire +1 more source
An Efficient Cycle Vector Space Algorithm for Listing all Cycles of a Planar Graph
SIAM journal on computing (Print), 1981M. Syslo
semanticscholar +1 more source
A sufficient condition for a planar graph to be class 1
Theoretical Computer Science, 2007Weifan Wang
exaly
Every planar graph without 4-cycles adjacent to two triangles is DP-4-colorable
Discrete Mathematics, 2019Xiangwen Li, Runrun Liu
exaly
Proceedings of the thirtieth annual ACM symposium on Theory of computing - STOC '98, 1998
Zhi-Zhong Chen +2 more
openaire +2 more sources
Zhi-Zhong Chen +2 more
openaire +2 more sources