找回密码
 To register

QQ登录

只需一步,快速开始

扫一扫,访问微社区

Titlebook: Combinatorics, Graph Theory and Computing; SEICCGTC 2021, Boca Frederick Hoffman,Sarah Holliday,John Wierman Conference proceedings 2024 T

[复制链接]
楼主: Autonomous
发表于 2025-3-30 09:07:00 | 显示全部楼层
Decomposition of the Johnson Graphs into Graph-Pairs of Order 4, the .-element subsets of a .-element set, and two vertices are adjacent if the intersection of the corresponding subsets contains . elements. We show necessary and sufficient conditions for .(., 2) to admit a decomposition into graph-pairs of order 4.
发表于 2025-3-30 13:53:40 | 显示全部楼层
,Multicore Graphs: Characterization and Properties,pp. 517:30–52 (2017)) [.]. We prove that the multicore graphs are the .-free chordal graphs and we present a characterization of the class which provides a simple linear time recognition algorithm. We also show its interrelation with other subclasses of chordal graphs: the clique-corona graphs and the starlike graphs.
发表于 2025-3-30 17:13:46 | 显示全部楼层
(2, 3)-Cordial Oriented Hypercubes, a (2, 3)-cordial oriented hypercube for any dimension divisible by 3. Next, we provide examples of (2, 3)-cordial oriented hypercubes of dimension not divisible by 3 and state a conjecture on existence for dimension .. We close by presenting the only 3D oriented hypercubes up to isomorphism that are not (2, 3)-cordial.
发表于 2025-3-30 21:11:07 | 显示全部楼层
,On the Locating Rainbow Connection Number of the Comb Product with Complete Graphs or Trees, and define the locating rainbow connection number within this framework. Our main results establish tight upper and lower bounds for . in the context of comb products. Additionally, we determine the locating rainbow connection number for the comb product of an arbitrary graph with a complete graph or a tree.
发表于 2025-3-31 01:00:38 | 显示全部楼层
,Cycle-Compelling Colorings of Graphs,tains a cycle. The cycle-compelling number is defined to be the minimum . such that some .-coloring is cycle-compelling. We provide some general bounds and algorithmic results on this and related parameters. We also investigate the value in specific graph families including cubic graphs, disjoint union of cliques, and outerplanar graphs.
发表于 2025-3-31 08:38:26 | 显示全部楼层
发表于 2025-3-31 10:01:42 | 显示全部楼层
发表于 2025-3-31 16:04:18 | 显示全部楼层
发表于 2025-3-31 19:37:01 | 显示全部楼层
发表于 2025-3-31 23:52:00 | 显示全部楼层
Jan Dijksterhuis,Robert A. Samson a (2, 3)-cordial oriented hypercube for any dimension divisible by 3. Next, we provide examples of (2, 3)-cordial oriented hypercubes of dimension not divisible by 3 and state a conjecture on existence for dimension .. We close by presenting the only 3D oriented hypercubes up to isomorphism that are not (2, 3)-cordial.
 关于派博传思  派博传思旗下网站  友情链接
派博传思介绍 公司地理位置 论文服务流程 影响因子官网 吾爱论文网 大讲堂 北京大学 Oxford Uni. Harvard Uni.
发展历史沿革 期刊点评 投稿经验总结 SCIENCEGARD IMPACTFACTOR 派博系数 清华大学 Yale Uni. Stanford Uni.
QQ|Archiver|手机版|小黑屋| 派博传思国际 ( 京公网安备110108008328) GMT+8, 2025-8-18 22:40
Copyright © 2001-2015 派博传思   京公网安备110108008328 版权所有 All rights reserved
快速回复 返回顶部 返回列表