Incidence coloring

Known as: Incidence colouring 
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)
Wikipedia

Topic mentions per year

Topic mentions per year

1993-2017
02419932017

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2017
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
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)
  • figure 1
Is this relevant?
2014
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)
  • figure 1
  • table I
  • figure 2
  • table III
  • table II
Is this relevant?
2013
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)
  • figure 1
Is this relevant?
2008
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)
  • figure 1
  • figure 2
  • figure 3
Is this relevant?
2004
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)
  • figure 1
Is this relevant?
2002
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)
  • figure 1
  • figure 3
  • figure 8
Is this relevant?
2002
2002
In 1993, Brualdi and Massey conjectured that every graph can be incidence colored with ∆+2 colors, where ∆ is the maximum degree… (More)
  • figure 4
  • figure 3
Is this relevant?
1997
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
We define the incidence coloring number of a graph and bound it in terms of the maximum degree. The incidence coloring number… (More)
  • figure I
  • figure 2
Is this relevant?