Backbone coloring for triangle-free planar graphs
From MaRDI portal
Publication:2401793
DOI10.1007/s10255-017-0700-3zbMath1372.65166OpenAlexW2744239937MaRDI QIDQ2401793
Publication date: 5 September 2017
Published in: Acta Mathematicae Applicatae Sinica. English Series (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10255-017-0700-3
Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Methods of successive quadratic programming type (90C55)
Cites Work
- Unnamed Item
- On backbone coloring of graphs
- \(\lambda \)-backbone colorings along pairwise disjoint stars and matchings
- (d,1)-total labeling of graphs with a given maximum average degree
- Backbone colorings for graphs: Tree and path backbones
- Backbone colorings along stars and matchings in split graphs: their span is close to the chromatic number
- Improved Upper Bounds for λ-Backbone Colorings Along Matchings and Stars
- Graph-Theoretic Concepts in Computer Science
This page was built for publication: Backbone coloring for triangle-free planar graphs