Color-induced graph colorings
DOI10.1007/978-3-319-20394-2zbMATH Open1365.05006OpenAlexW1429250800MaRDI QIDQ5262890FDOQ5262890
Authors: Ping Zhang
Publication date: 9 July 2015
Published in: SpringerBriefs in Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-20394-2
Recommendations
graph coloringstrong coloringsbinomial coloringscolor-induced graph coloringsedge-graceful coloringsirregular coloringsmodular coloringstwin edge colorings
Research exposition (monographs, survey articles) pertaining to combinatorics (05-02) Coloring of graphs and hypergraphs (05C15)
Cited In (16)
- Strategic Coloring of a Graph
- On the complexity of gap-\([2]\)-vertex-labellings of subcubic bipartite graphs
- On twin edge colorings in m-ary trees
- Nested colourings of graphs
- Title not available (Why is that?)
- On indicated coloring of graphs
- Graph coloring: a novel heuristic based on trailing path-properties, perspective and applications in structured networks
- Vertex identification in trees
- Title not available (Why is that?)
- Complexity of the improper twin edge coloring of graphs
- Title not available (Why is that?)
- Color chain of a graph
- On rainbow mean colorings of trees
- Highly Irregular
- Colorful induced subgraphs
- Title not available (Why is that?)
This page was built for publication: Color-induced graph colorings
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5262890)