Discrete Mathematics, ISSN 0012-365X, 2004, Volume 283, Issue 1, pp. 121 - 128

We prove that the incidence coloring number of every k-degenerated graph G is at most Δ( G)+2 k−1. For K 4-minor free graphs ( k=2), we decrease this bound to...

K4-minor free graph | Planar graph | Incidence coloring | k-degenerated graph | minor free graph | MATHEMATICS | incidence coloring | planar graph | STAR ARBORICITY | K-4-minor free graph

K4-minor free graph | Planar graph | Incidence coloring | k-degenerated graph | minor free graph | MATHEMATICS | incidence coloring | planar graph | STAR ARBORICITY | K-4-minor free graph

Journal Article

Information Processing Letters, ISSN 0020-0190, 2006, Volume 98, Issue 6, pp. 247 - 252

An oriented k-coloring of an oriented graph G is a mapping c : V ( G ) → { 1 , 2 , … , k } such that (i) if x y ∈ E ( G ) then c ( x ) ≠ c ( y ) and (ii) if x...

Graph homomorphism | Combinatorial problems | Graph coloring | Oriented graph coloring | oriented graph coloring | combinatorial problems | COLORINGS | graph homomorphism | PLANAR GRAPHS | COMPUTER SCIENCE, INFORMATION SYSTEMS | graph coloring

Graph homomorphism | Combinatorial problems | Graph coloring | Oriented graph coloring | oriented graph coloring | combinatorial problems | COLORINGS | graph homomorphism | PLANAR GRAPHS | COMPUTER SCIENCE, INFORMATION SYSTEMS | graph coloring

Journal Article

Information Processing Letters, ISSN 0020-0190, 06/2006, Volume 98, Issue 6, p. 247

Journal Article

Discrete Mathematics, ISSN 0012-365X, 2006, Volume 306, Issue 13, pp. 1342 - 1350

The excess of a graph G is defined as the minimum number of edges that must be deleted from G in order to get a forest. We prove that every graph with excess...

Graph homomorphism | Graph coloring | Oriented graph coloring | Betti number | oriented graph coloring | MATHEMATICS | PLANAR GRAPHS | graph coloring | graph homomorphism | Computer Science | Other | Discrete Mathematics

Graph homomorphism | Graph coloring | Oriented graph coloring | Betti number | oriented graph coloring | MATHEMATICS | PLANAR GRAPHS | graph coloring | graph homomorphism | Computer Science | Other | Discrete Mathematics

Journal Article

Discrete Mathematics and Theoretical Computer Science, ISSN 1365-8050, 2005, Volume 7, Issue 1, pp. 203 - 216

We prove that the incidence chromatic number of every 3-degenerated graph G is at most Delta(G)+ 4. It is known that the incidence chromatic number of every...

K-degenerated graph | Planar graph | Incidence coloring | Maximum average degree | COMPUTER SCIENCE, SOFTWARE ENGINEERING | MATHEMATICS | MATHEMATICS, APPLIED | STAR ARBORICITY | k-degenerated graph | maximum average degree | incidence coloring | planar graph | Computer Science | Discrete Mathematics

K-degenerated graph | Planar graph | Incidence coloring | Maximum average degree | COMPUTER SCIENCE, SOFTWARE ENGINEERING | MATHEMATICS | MATHEMATICS, APPLIED | STAR ARBORICITY | k-degenerated graph | maximum average degree | incidence coloring | planar graph | Computer Science | Discrete Mathematics

Journal Article

Information Processing Letters, ISSN 0020-0190, 2005, Volume 98, pp. 247 - 252

An oriented k-coloring of an oriented graph G is a mapping c from V(G) to { 1, 2, \ldots , k} such that (i) if xy \in E(G) then c (x) \neq c(y) and (ii) if xy,...

Computer Science | Other | Discrete Mathematics

Computer Science | Other | Discrete Mathematics

Journal Article

Discrete Mathematics, ISSN 0012-365X, 2004, Volume 283, pp. 121 - 128

We prove that the incidence coloring number of every k-degenerated graph G is at most \Delta(G)+2k-1. For K_4-minor free graphs (k=2), we decrease this bound...

Computer Science | Other | Discrete Mathematics

Computer Science | Other | Discrete Mathematics

Journal Article

No results were found for your search.

Cannot display more than 1000 results, please narrow the terms of your search.