X
Search Filters
Format Format
Subjects Subjects
Subjects Subjects
X
Sort by Item Count (A-Z)
Filter by Count
computer science (4) 4
discrete mathematics (4) 4
mathematics (3) 3
other (3) 3
graph coloring (2) 2
graph homomorphism (2) 2
incidence coloring (2) 2
k-degenerated graph (2) 2
oriented graph coloring (2) 2
planar graph (2) 2
planar graphs (2) 2
star arboricity (2) 2
[ info.info-dm ] computer science [cs]/discrete mathematics [cs.dm] (1) 1
[ info.info-oh ] computer science [cs]/other [cs.oh] (1) 1
betti number (1) 1
colorings (1) 1
combinatorial problems (1) 1
computer science, information systems (1) 1
computer science, software engineering (1) 1
discrete mathematics and combinatorics (1) 1
graphs (1) 1
k-4-minor free graph (1) 1
k4-minor free graph (1) 1
mapping (1) 1
mathematics, applied (1) 1
maximum average degree (1) 1
minor free graph (1) 1
studies (1) 1
theoretical computer science (1) 1
more...
Language Language
Publication Date Publication Date
Click on a bar to filter by decade
Slide to change publication date range


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
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
Journal Article
Information Processing Letters, ISSN 0020-0190, 06/2006, Volume 98, Issue 6, p. 247
  An oriented k-coloring of an oriented graph G is a mapping C:V(G) > {1,2,...,k} such that (i) if xy E E(G) then c(x)=c(y) and (ii) if xy,zt E E(G) then... 
Studies | Graphs | Mapping
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
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
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
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
Journal Article
No results were found for your search.

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