On Consecutive labeling of plane graphs

Simple item page
dc.contributor.authorBača, Martin
dc.date.accessioned2016-07-08
dc.date.available2016-07-08
dc.date.issued1991
dc.description.abstractThis paper concerns a labeling problem of the plane graphs Pmn. The present paper describes a magic vertex labeling and a consecutive labeling of type (0,1,1). These labelings combine to a consecutive labeling of type (1,1,1). © 1991.en
dc.formattext
dc.identifier.doi10.1016/0016-0032(91)90033-Y
dc.identifier.issn0016-0032
dc.identifier.scopus2-s2.0-0025767389
dc.identifier.urihttps://dspace.tul.cz/handle/15240/16558
dc.language.isoen
dc.relation.ispartofJournal of the Franklin Institute
dc.relation.ispartofJournal of the Franklin Instituteen
dc.sourcej-scopus
dc.sourcej-wok
dc.titleOn Consecutive labeling of plane graphsen
dc.typearticle
local.accessopen access
local.citation.epage253
local.citation.spage249
local.departmentDepartment of Applied Mathematics
local.facultyFaculty of Science, Humanities and Education
local.fulltextyes
local.fulltextyes
local.identifier.codenJFINA
local.identifier.wokA1991FB49700006
local.notenefunguje RIV
local.relation.issue2.3.2016
local.relation.volume328
Files
Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
2-s2.0-0025767389-o.pdf
Size:
219.18 KB
Format:
Adobe Portable Document Format
Description:
Článek
Download
Collections