On the packing chromatic number of Cartesian products, hexagonal lattice, and trees

Bresar B; Klavzar S; Rall DF

首页> 外文期刊>Discrete Applied Mathematics >On the packing chromatic number of Cartesian products, hexagonal lattice, and trees

【24h】

On the packing chromatic number of Cartesian products, hexagonal lattice, and trees

机译：关于笛卡尔乘积，六边形格子和树的包装色数

获取原文

获取原文并翻译 | 示例

掌桥外文数据库（机构版） >>

开具论文收录证明 >>

文献代查 >>

页面导航

摘要
著录项
相似文献
相关主题

摘要

The packing chromatic number chi(p)(G) of a graph G is the smallest integer k such that the vertex set of G can be partitioned into packings with pairwise different widths. Several lower and upper bounds are obtained for the packing chromatic number of Cartesian products of graphs. It is proved that the packing chromatic number of the infinite hexagonal lattice lies between 6 and 8. Optimal lower and upper bounds are proved for subdivision graphs. Trees are also considered and monotone colorings are introduced. (C) 2007 Elsevier B.V. All rights reserved.

著录项

来源
《Discrete Applied Mathematics》 |2007年第17期|共9页
作者
Bresar B; Klavzar S; Rall DF;
展开▼
作者单位

展开▼
收录信息
原文格式 PDF
正文语种 eng
中图分类离散数学;
关键词
packing chromatic number; Cartesian product of graphs; hexagonal lattice; subdivision graph; tree; computational complexity; INDEPENDENCE NUMBER; GRAPHS;

机译：填充色数;图的笛卡尔积;六边形格;细分图;树;计算复杂度;独立数;图;

相似文献

外文文献
中文文献
专利

1. On the packing chromatic number of Cartesian products, hexagonal lattice, and trees [J] . Bresar B, Klavzar S, Rall DF Discrete Applied Mathematics . 2007,第17期

机译：关于笛卡尔乘积，六边形格子和树的包装色数
2. A lower bound for the packing chromatic number of the Cartesian product of cycles : Open Mathematics [J] . Yolandé Jacobs, Elizabeth Jonck, Ernst Joubert Open Mathematics . 2013,第7期

机译：循环的笛卡尔积的包装色数的下限：开放数学
3. Packing the Cartesian Product of Two Complete Graphs with Hexagons [J] . Hung-Lin Fu, Ming-Hway Huang Utilitas mathematica . 2005,第0期

机译：用六角形包装两个完整图形的笛卡尔积
4. Distinguishing Chromatic Numbers for Cartesian Products of Graphs [C] . Robert A. Beeler, Jackie L. Everhardt III Southeastern internaitonal conference on combinatorics, graph theory and computing . 2009

机译：区分图的笛卡尔积的色数
5. Random Walks on Cartesian Products of Certain Nonamenable Groups and Integer Lattices [D] . Vishnepolsky, Rachel. 2017

机译：随机散步在某些不可享受团体和整数格子的笛卡尔产品上
6. Correlated cryogenic fluorescence microscopy and electron cryo-tomography shows that exogenous TRIM5α can form hexagonal lattices or autophagy aggregates in vivo [O] . Stephen D. Carter, João I. Mamede, Thomas J. Hope, 2020

机译：相关的低温荧光显微镜和电子冷冻层析成像显示出外源磨削5α可以在体内形成六边形格子或自噬聚集体
7. On the packing chromatic number of Cartesian products, hexagonal lattice, and trees [O] . Brešar Boštjan, Klavžar Sandi, Rall Douglas F. 2007

机译：关于笛卡尔乘积，六边形格子和树的包装色数

On the packing chromatic number of Cartesian products, hexagonal lattice, and trees

摘要

著录项

相似文献

相关主题

期刊订阅