A note of vertex arboricity of planar graphs without 4-cycles intersecting with 6-cycles
From MaRDI portal
(Redirected from Publication:2193274)
Recommendations
Cites work
- On the vertex arboricity of planar graphs of diameter two
- On the vertex-arboricity of \(K_5\)-minor-free graphs of diameter 2
- On the vertex-arboricity of planar graphs
- On the vertex-arboricity of planar graphs without 7-cycles
- The Point-Arboricity of Planar Graphs
- The point-arboricity of a graph
- Vertex arboricity of planar graphs without chordal 6-cycles
- Vertex arboricity of planar graphs without intersecting 5-cycles
- Vertex arboricity of toroidal graphs with a forbidden cycle
- Vertex-arboricity of planar graphs without intersecting triangles
Cited in
(15)- Planar graphs without intersecting 5-cycles are signed-4-choosable
- List injective coloring of planar graphs with disjoint \(5^-\)-cycles
- A note on global dominator coloring of graphs
- Vertex arboricity of planar graphs without intersecting 5-cycles
- Approximation algorithms for the submodular edge cover problem with submodular penalties
- On the double total dominator chromatic number of graphs
- Circular vertex arboricity
- Incidence coloring of mycielskians with fast algorithm
- Vertex arboricity of planar graphs without chordal 6-cycles
- A note on no-free-lunch theorem
- Vertex 2-arboricity of planar graphs without 4-cycles adjacent to 6-cycles
- On generalized neighbor sum distinguishing index of planar graphs
- On the vertex-arboricity of planar graphs
- Vertex arboricity of graphs embedded in a surface of non-negative Euler characteristic
- Equitable vertex arboricity of planar graphs
This page was built for publication: A note of vertex arboricity of planar graphs without 4-cycles intersecting with 6-cycles
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2193274)