Edge coloring models as singular vertex coloring models

5Citations
Citations of this article
2Readers
Mendeley users who have this article in their library.

You may have access to this PDF.

Abstract

In this paper we study an interesting class of graph parameters. These parameters arise both from edge coloring models and from limits of vertex coloring models with a fixed number of vertices. Their vertex connection matrices have exponentially bounded rank growth.

Cite

CITATION STYLE

APA

Szegedy, B. (2010). Edge coloring models as singular vertex coloring models. In Bolyai Society Mathematical Studies (Vol. 20, pp. 327–336). https://doi.org/10.1007/978-3-642-13580-4_12

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free