Partial packing coloring and quasi-packing coloring of the triangular grid
From MaRDI portal
Publication:6646429
DOI10.1016/j.disc.2024.114308MaRDI QIDQ6646429
Konstanty Junosza-Szaniawski, Hubert Grochowski
Publication date: 2 December 2024
Published in: Discrete Mathematics (Search for Journal in Brave)
Applications of graph theory (05C90) Small world graphs, complex networks (graph-theoretic aspects) (05C82) Integer programming (90C10) Linear programming (90C05) Hypergraphs (05C65) Coloring of graphs and hypergraphs (05C15)
Cites Work
- Unnamed Item
- Unnamed Item
- \(S\)-packing colorings of cubic graphs
- Packing chromatic number under local changes in a graph
- The packing chromatic number of the infinite square lattice is between 13 and 15
- On the packing chromatic number of some lattices
- The packing chromatic number of infinite product graphs
- Relations between packing and covering numbers of a tree
- An infinite family of subcubic graphs with unbounded packing chromatic number
- Packing chromatic number of cubic graphs
- On the packing chromatic number of subcubic outerplanar graphs
- Packing chromatic number of subdivisions of cubic graphs
- On the number of 2-packings in a connected graph
- Modeling the packing coloring problem of graphs
- Graphs with unique maximum packing of closed neighborhoods
- A survey on packing colorings
- Cooperative colorings of trees and of bipartite graphs
- A survey on graphs which have equal domination and closed neighbourhood packing numbers
- A note on packing chromatic number of the square lattice
- A note on \(S\)-packing colorings of lattices
- The S-packing chromatic number of a graph
- On the packing chromatic number of square and hexagonal lattice
- (Open) packing number of some graph products
- Adapted List Coloring of Graphs and Hypergraphs
- Labelling Graphs with a Condition at Distance 2
- Domination, Fractional Domination, 2-Packing, and Graph Products
- Incidence dimension and 2-packing number in graphs
- Complexity of the Packing Coloring Problem for Trees
- Combinatorial Geometry and Graph Theory
- About \(S\)-packing coloring of subcubic graphs
- The packing chromatic number of the infinite square grid is 15
- Cooperative coloring of some graph families
- The packing chromatic number of the infinite square grid is at least 14
This page was built for publication: Partial packing coloring and quasi-packing coloring of the triangular grid