Papers
Topics
Authors
Recent
Assistant
AI Research Assistant
Well-researched responses based on relevant abstracts and paper content.
Custom Instructions Pro
Preferences or requirements that you'd like Emergent Mind to consider when generating responses.
Gemini 2.5 Flash
Gemini 2.5 Flash 138 tok/s
Gemini 2.5 Pro 49 tok/s Pro
GPT-5 Medium 24 tok/s Pro
GPT-5 High 31 tok/s Pro
GPT-4o 92 tok/s Pro
Kimi K2 189 tok/s Pro
GPT OSS 120B 450 tok/s Pro
Claude Sonnet 4.5 34 tok/s Pro
2000 character limit reached

$S$-Packing Coloring of Cubic Halin Graphs (2209.09135v2)

Published 19 Sep 2022 in math.CO and cs.DM

Abstract: Given a non-decreasing sequence $S = (s_{1}, s_{2}, \ldots , s_{k})$ of positive integers, an $S$-packing coloring of a graph $G$ is a partition of the vertex set of $G$ into $k$ subsets ${V_{1}, V_{2}, \ldots , V_{k}}$ such that for each $1 \leq i \leq k$, the distance between any two distinct vertices $u$ and $v$ in $V_{i}$ is at least $s_{i} + 1$. In this paper, we study the problem of $S$-packing coloring of cubic Halin graphs, and we prove that every cubic Halin graph is $(1,1,2,3)$-packing colorable. In addition, we prove that such graphs are $(1,2,2,2,2,2)$-packing colorable.

Summary

We haven't generated a summary for this paper yet.

Lightbulb Streamline Icon: https://streamlinehq.com

Continue Learning

We haven't generated follow-up questions for this paper yet.

List To Do Tasks Checklist Streamline Icon: https://streamlinehq.com

Collections

Sign up for free to add this paper to one or more collections.

Don't miss out on important new AI/ML research

See which papers are being discussed right now on X, Reddit, and more:

“Emergent Mind helps me see which AI papers have caught fire online.”

Philip

Philip

Creator, AI Explained on YouTube