On vertex b-critical trees

DOI10.7494/OPMATH.2013.33.1.19MaRDI QIDQ2842003zbMATH OpenFDO

Authors Mostafa Blidia, Noureddine Ikhlef Eschouf, Frédéric Maffray

Publication date 30 July 2013

Published in Opuscula Mathematica (Search for Journal in Brave)

Full work available at URL https://doi.org/10.7494/OPMATH.2013.33.1.19

zbMATH Keywords

\(b\)-coloring\(b\)-critical graphsb-critical trees

Mathematics Subject Classification ID

Trees (05C05) Coloring of graphs and hypergraphs (05C15)

Recommendations

• A characterization of b_e-critical trees
• scientific article; zbMATH DE number 13194
• On b-vertex and b-edge critical graphs
• On the critical point-arboricity graphs
• A structural property of trees with an application to vertex-arboricity
• Vertex and tree arboricities of graphs
• On arbitrarily vertex decomposable trees
• On edge-\(b\)-critical graphs
• Bounds on the vertex-edge domination number of a tree
• On Cotree-Critical and DFS Cotree-Critical Graphs

Cited in

(11)

• The b-chromatic number and related topics -- a survey
• A characterization of b-chromatic and partial Grundy numbers by induced subgraphs
• On critical trees labeled with a condition at distance two
• On edge-\(b\)-critical graphs
• A characterization of b_e-critical trees
• Characterization of some b-chromatic edge critical graphs
• \(B\)-chromatic number of cacti
• On the sd_b-critical graphs
• On the b-coloring of tight graphs
• A characterization of edge \(b\)-critical graphs
• On b-vertex and b-edge critical graphs

This page was built for publication: On vertex \(b\)-critical trees

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2842003)