OWL
发表于 2025-3-23 12:35:07
t families of graphs such as trees, cycles, complete bipartite graphs, outerplanar graphs and 2-dimensional grids. We also study and give bounds for the star chromatic number of other families of graphs, such as hypercubes, tori, .-dimensional grids, graphs with bounded treewidth and planar graphs.
嫌恶
发表于 2025-3-23 14:19:28
http://reply.papertrans.cn/39/3881/388030/388030_12.png
连锁,连串
发表于 2025-3-23 18:07:02
Edge-Isoperimetric Problems for Cartesian Powers of Regular Graphs,es all presently known graphs with this property. Our new results are applied to derive best possible edge-isoperimetric inequalities for the cartesian powers of arbitrary regular, resp. regular bipartite, graphs with a high density.
倔强一点
发表于 2025-3-23 23:01:59
Maximum Clique Transversals,f minimum cardinality. We consider the problem for planar graphs and present fixed parameter and approximation results..We also examine some other graph classes: subclasses of chordal graphs such as k-trees, strongly chordal graphs, etc., graphs with few . ., comparability graphs, and distance hereditary graphs.
冒号
发表于 2025-3-24 04:18:21
http://reply.papertrans.cn/39/3881/388030/388030_15.png
Subdue
发表于 2025-3-24 09:33:00
http://reply.papertrans.cn/39/3881/388030/388030_16.png
eucalyptus
发表于 2025-3-24 14:06:01
(,+) -Disatance- Herediatry Graphs,.. The class of all these graphs is denoted by DH(., +) By varying the parameter ., classes DH(., +) form a hierarchy that represents a parametric extension of the well-known class of distance-hereditary graphs, and include all graphs.
遗弃
发表于 2025-3-24 16:03:24
http://reply.papertrans.cn/39/3881/388030/388030_18.png
顾客
发表于 2025-3-24 21:17:57
http://reply.papertrans.cn/39/3881/388030/388030_19.png
acrophobia
发表于 2025-3-25 02:41:12
Small ,-Dominating Sets in Planar Graphs with Applications, = O(1/ε). For several subclasses of planar graphs of diameter ., we show that γ.(.) is bounded by a constant for . ≽ ./2. We conjecture that the same result holds for every planar graph. This problem is motivated by the design of routing schemes with compact data structures.