scientific article; zbMATH DE number 7800928
From MaRDI portal
Publication:6188237
Publication date: 7 February 2024
Full work available at URL: https://applmath.cjoe.ac.cn/jweb_yysxxb/EN/10.12387/C2022008
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Coloring of graphs and hypergraphs (05C15) Ordered topological linear spaces, vector lattices (46A40) Quantum information, communication, networks (quantum-theoretic aspects) (81P45)
Cites Work
- A polynomial-time nearly-optimal algorithm for an edge coloring problem in outerplanar graphs
- Linear coloring of planar graphs without 4-cycles
- Some results on spanning trees
- Total coloring of planar graphs without 6-cycles
- Total coloring of embedded graphs of maximum degree at least ten
- Total colorings of planar graphs with maximum degree seven and without intersecting 3-cycles
- A new upper bound on the acyclic chromatic indices of planar graphs
- Total coloring of planar graphs with maximum degree \(7\)
- Circular vertex arboricity
- Some bounds on the neighbor-distinguishing index of graphs
- Edge Coloring of Triangle-Free 1-Planar Graphs
- Acyclic edge chromatic number of outerplanar graphs
- 1-平面图的结构性质及其在无圈边染色上的应用
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication:
