Pages that link to "Item:Q2193274"
From MaRDI portal
The following pages link to A note of vertex arboricity of planar graphs without 4-cycles intersecting with 6-cycles (Q2193274):
Displaying 14 items.
- Equitable vertex arboricity of planar graphs (Q514833) (← links)
- Vertex arboricity of planar graphs without intersecting 5-cycles (Q1702820) (← links)
- Approximation algorithms for the submodular edge cover problem with submodular penalties (Q2031056) (← links)
- Incidence coloring of mycielskians with fast algorithm (Q2043007) (← links)
- Circular vertex arboricity (Q2275930) (← links)
- On the vertex-arboricity of planar graphs (Q2427551) (← links)
- Vertex 2-arboricity of planar graphs without 4-cycles adjacent to 6-cycles (Q2680856) (← links)
- Vertex arboricity of planar graphs without chordal 6-cycles (Q2868169) (← links)
- A note on no-free-lunch theorem (Q5057731) (← links)
- On generalized neighbor sum distinguishing index of planar graphs (Q5083874) (← links)
- List injective coloring of planar graphs with disjoint 5−-cycles (Q5083875) (← links)
- Planar graphs without intersecting 5-cycles are signed-4-choosable (Q5101876) (← links)
- On the double total dominator chromatic number of graphs (Q5101880) (← links)
- A note on global dominator coloring of graphs (Q5101885) (← links)
