Circular vertex arboricity (Q2275930)

From MaRDI portal

Jump to:navigation, search

scientific article

Language	Label	Description	Also known as
English	Circular vertex arboricity	scientific article

Statements

scholarly article

0 references

Circular vertex arboricity (English)

0 references

0 references

0 references

0 references

0 references

Discrete Applied Mathematics

0 references

publication date

10 August 2011

0 references

zbMATH Keywords

vertex arboricity

0 references

circular vertex arboricity

0 references

partitions

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1016/j.dam.2011.04.009

0 references

Every planar graph has an acyclic 7-coloring

0 references

A note on the star chromatic number

0 references

On acyclic colorings of planar graphs

0 references

Homomorphisms from sparse graphs with large girth.

0 references

Vertex arboricity and maximum degree

0 references

The point-arboricity of a graph

0 references

Circular chromatic number and Mycielski graphs

0 references

Acyclic colorings of planar graphs

0 references

0 references

Critical Point-Arboritic Graphs

0 references

Every planar graph has an acyclic 8-coloring

0 references

On the vertex-arboricity of planar graphs

0 references

On the critical point-arboricity graphs

0 references

Fractional Vertex Arboricity of Graphs

0 references

Circular chromatic number: A survey

0 references

Vertex arboricity of integer distance graph \(G(D_{m,k})\)

0 references

Identifiers

zbMATH Open document ID

0 references

10.1016/j.dam.2011.04.009

0 references

Mathematics Subject Classification ID

0 references

zbMATH DE Number

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:2275930

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q2275930&oldid=35242152"