Extending an extension of Grinberg's theorem

Joseph Zaks

doi:10.1016/0095-8956(82)90080-6

Extending an extension of Grinberg's theorem

Joseph Zaks

Department of Mathematics

Research output: Contribution to journal › Article › peer-review

Abstract

Grinberg's well-known necessary condition for a planar graph to be Hamiltonian was extended by Shimamoto to a condition for having a 2-factor. We derive a necessary condition for a planar graph to contain a collection of n disjoint circuits, none of which separates any other two. All is done in terms of the numbers p_k which denote the numbers of k-gonal faces.

Original language	English
Pages (from-to)	95-98
Number of pages	4
Journal	Journal of Combinatorial Theory. Series B
Volume	32
Issue number	1
DOIs	https://doi.org/10.1016/0095-8956(82)90080-6
State	Published - Feb 1982

ASJC Scopus subject areas

Theoretical Computer Science
Discrete Mathematics and Combinatorics
Computational Theory and Mathematics

Access to Document

10.1016/0095-8956(82)90080-6

Cite this

@article{e130d4bcc12246c593fcb7617fbe299f,

title = "Extending an extension of Grinberg's theorem",

abstract = "Grinberg's well-known necessary condition for a planar graph to be Hamiltonian was extended by Shimamoto to a condition for having a 2-factor. We derive a necessary condition for a planar graph to contain a collection of n disjoint circuits, none of which separates any other two. All is done in terms of the numbers pk which denote the numbers of k-gonal faces.",

author = "Joseph Zaks",

year = "1982",

month = feb,

doi = "10.1016/0095-8956(82)90080-6",

language = "English",

volume = "32",

pages = "95--98",

journal = "Journal of Combinatorial Theory. Series B",

issn = "0095-8956",

publisher = "Academic Press Inc.",

number = "1",

}

TY - JOUR

T1 - Extending an extension of Grinberg's theorem

AU - Zaks, Joseph

PY - 1982/2

Y1 - 1982/2

N2 - Grinberg's well-known necessary condition for a planar graph to be Hamiltonian was extended by Shimamoto to a condition for having a 2-factor. We derive a necessary condition for a planar graph to contain a collection of n disjoint circuits, none of which separates any other two. All is done in terms of the numbers pk which denote the numbers of k-gonal faces.

AB - Grinberg's well-known necessary condition for a planar graph to be Hamiltonian was extended by Shimamoto to a condition for having a 2-factor. We derive a necessary condition for a planar graph to contain a collection of n disjoint circuits, none of which separates any other two. All is done in terms of the numbers pk which denote the numbers of k-gonal faces.

UR - http://www.scopus.com/inward/record.url?scp=33745869239&partnerID=8YFLogxK

U2 - 10.1016/0095-8956(82)90080-6

DO - 10.1016/0095-8956(82)90080-6

M3 - Article

AN - SCOPUS:33745869239

SN - 0095-8956

VL - 32

SP - 95

EP - 98

JO - Journal of Combinatorial Theory. Series B

JF - Journal of Combinatorial Theory. Series B

IS - 1

ER -

Extending an extension of Grinberg's theorem

Abstract

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this