Chromatic graph theory
From MaRDI portal
Publication:5205260
DOI10.1201/9780429438868zbMATH Open1427.05001OpenAlexW4239800961MaRDI QIDQ5205260FDOQ5205260
Authors: Gary Chartrand, Ping Zhang
Publication date: 10 December 2019
Full work available at URL: https://doi.org/10.1201/9780429438868
Recommendations
Introductory exposition (textbooks, tutorial papers, etc.) pertaining to combinatorics (05-01) Graph theory (05Cxx)
Cited In (38)
- On radio connection number of graphs
- Title not available (Why is that?)
- Okhuma graphs and coloured chains
- A Chromatic Metric on Graphs
- A note on δ^(k)-colouring of the Cartesian product of some graphs
- Achromatic numbers for circulant graphs and digraphs
- Characterizations of graphs having large proper connection numbers
- On \(\delta^{(k)}\)-coloring of generalized Petersen graphs
- A textbook of graph theory
- On \(\delta^{(k)}\)-coloring of powers of helm and closed helm graphs
- A beginner's guide to graph theory
- Effective Poset Inequalities
- Combinatorial Relations and Chromatic Graphs
- Ramsey sequences of graphs
- On zonal and inner zonal labelings of plane graphs of maximum degree 3
- Title not available (Why is that?)
- Zonal graphs of small cycle rank
- The New Mathematical Coloring Book
- Title not available (Why is that?)
- New directions in Ramsey theory
- Colouring a dominating set without conflicts: \(q\)-subset square colouring
- Chromatic graph theory
- Operations on independence numbers of certain graph classes
- Open neighbourhood colouring of some path related graphs
- Title not available (Why is that?)
- Total dominator total coloring of a graph
- On subset labelings of trees
- Graph coloring methods
- On twin edge colorings of graphs
- Rainbow mean colorings of graphs
- Title not available (Why is that?)
- On rainbow mean colorings of trees
- Stratified domination
- Chromaticity of chordal graphs
- Variants of the segment number of a graph
- Coloring a dominating set without conflicts: \(q\)-subset square coloring
- Coloring chip configurations on graphs and digraphs
- New results on the robust coloring problem
This page was built for publication: Chromatic graph theory
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5205260)