In graph theory, coloring generally implies assignment of labels to vertices, edges or faces in a graph. The incidence coloring is a special graphâ€¦Â (More)

Semantic Scholar uses AI to extract papers important to this topic.

2017

2017

- Anna Malafiejska, Michal Malafiejski
- Discussiones Mathematicae Graph Theory
- 2017

For a given simple graph G = (V,E), we define an incidence as a pair (v, e), where vertex v âˆˆ V (G) is one of the ends of edge eâ€¦Â (More)

Is this relevant?

2017

2017

- Marthe Bonamy, HervÃ© Hocquard, Samia Kerdjoudj, AndrÃ© Raspaud
- Discrete Applied Mathematics
- 2017

An incidence of an undirected graph G is a pair (v, e) where v is a vertex of G and e an edge of G incident with v. Twoâ€¦Â (More)

Is this relevant?

2014

2014

- Kung-Jui Pai, Jou-Ming Chang, Jinn-Shyong Yang, Ro-Yu Wu
- 2014 International Computer Science andâ€¦
- 2014

Let <sub>Xi</sub>(G) denote the incidence coloring number of a graph G. An easy observation shows that <sub>Xi</sub>(G) â‰¥ Î”(Gâ€¦Â (More)

Is this relevant?

2013

2013

- ClÃ©ment Charpentier, Ã‰ric Sopena
- IWOCA
- 2013

An incidence of a graph G is a pair (v, e) where v is a vertex of G and e an edge incident to v. Two incidences (v, e) and (w, fâ€¦Â (More)

Is this relevant?

2008

2008

- Wai Chee Shiu, Pak Kiu Sun
- Discrete Mathematics
- 2008

Incidence coloring of a graph G is a mapping from the set of incidences to a color-set C such that adjacent incidences of G areâ€¦Â (More)

Is this relevant?

2004

2004

- Mohammad Hosseini Dolama, Ã‰ric Sopena, Xuding Zhu
- Discrete Mathematics
- 2004

We prove that the incidence coloring number of every k-degenerated graph G is at most (G) + 2k âˆ’ 1. For K4-minor free graphs (kâ€¦Â (More)

Is this relevant?

2002

2002

- Shu-Dong Wang, Dong-Ling Chen, Shan-Chen Pang
- Discrete Mathematics
- 2002

In this paper, we shall prove that the incidence coloring number for Halin graphs of maximum degree greater than or equal to 5â€¦Â (More)

Is this relevant?

2002

2002

- Wai Chee Shiu, Peter Che Bor Lam, Dong-Ling Chen
- Discrete Mathematics
- 2002

In 1993, Brualdi and Massey conjectured that every graph can be incidence colored with âˆ†+2 colors, where âˆ† is the maximum degreeâ€¦Â (More)

Is this relevant?

1997

1997

- Barry Guiduli
- Discrete Mathematics
- 1997

In this note we show that the concept of incidence coloring introduced in [BM] is a special case of directed star arboricityâ€¦Â (More)

Is this relevant?

1993

1993

- Richard A. Brualdi, Jennifer J. Quinn Massey
- Discrete Mathematics
- 1993

We define the incidence coloring number of a graph and bound it in terms of the maximum degree. The incidence coloring numberâ€¦Â (More)

Is this relevant?