\(\lambda \)-backbone colorings along pairwise disjoint stars and matchings
From MaRDI portal
Publication:1045046
DOI10.1016/J.DISC.2008.04.007zbMath1213.05068OpenAlexW2107222901MaRDI QIDQ1045046
Daniël Paulusma, A. N. M. Salman, Loris Marchal, Kiyoshi Yoshimoto, Jun Fujisawa, Hajo J. Broersma
Publication date: 15 December 2009
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2008.04.007
Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Coloring of graphs and hypergraphs (05C15)
Related Items (15)
Circular backbone colorings: on matching and tree backbones of planar graphs ⋮ Backbone coloring for triangle-free planar graphs ⋮ Backbone coloring for graphs with large girths ⋮ Backbone colouring: tree backbones with small diameter in planar graphs ⋮ On backbone coloring of graphs ⋮ List backbone colouring of graphs ⋮ Backbone coloring of planar graphs without special circles ⋮ (Circular) backbone colouring: forest backbones in planar graphs ⋮ The computational complexity of the backbone coloring problem for bounded-degree graphs with connected backbones ⋮ The backbone coloring problem for bipartite backbones ⋮ Backbone colorings of graphs with bounded degree ⋮ Backbone coloring of graphs with galaxy backbones ⋮ Backbone coloring of graphs with galaxy backbones ⋮ The computational complexity of the backbone coloring problem for planar graphs with connected backbones ⋮ Backbone coloring of planar graphs for \(C_8\)-free or \(C_9\)-free
Cites Work
- A bound on the chromatic number of the square of a planar graph
- Labelling Graphs with a Condition at Distance 2
- Graph labeling and radio channel assignment
- Coloring Powers of Planar Graphs
- Coloring the square of a planar graph
- The $L(2,1)$-Labeling Problem on Graphs
- Improved Upper Bounds for λ-Backbone Colorings Along Matchings and Stars
- Combinatorial Geometry and Graph Theory
- Graph-Theoretic Concepts in Computer Science
- Fixed-parameter complexity of \(\lambda\)-labelings
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: \(\lambda \)-backbone colorings along pairwise disjoint stars and matchings