scholarly journals Edge coloring of simple graphs and edge -face coloring of simple plane graphs

2002 ◽  
Author(s):  
Rong Luo
Keyword(s):  
Edge Coloring ◽  
Plane Graphs ◽  
Simple Graphs

FUZZY EQUITABLE EDGE COLORING OF SOME SIMPLE GRAPHS

2020 ◽  
Vol 9 (11) ◽  
pp. 9303-9310
Author(s):  
K. Sivaraman ◽  
R.V. Prasad
Keyword(s):  
Edge Coloring ◽  
Simple Graphs ◽  
Equitable Edge Coloring

In our earlier works, we have discussed about the equitable edge coloring of various classes of some simple graphs (or crisp graphs). In this Paper we are going to state and discuss the Fuzzy equitable edge coloring of some classes of simple graphs.

Some results on acyclic edge coloring of plane graphs

2010 ◽  
Vol 110 (20) ◽  
pp. 887-892 ◽  
Author(s):  
Wei Dong ◽  
Baogang Xu
Keyword(s):  
Edge Coloring ◽  
Plane Graphs ◽  
Acyclic Edge Coloring

scholarly journals Facial packing edge-coloring of plane graphs

2016 ◽  
Vol 213 ◽  
pp. 71-75 ◽  
Author(s):  
Július Czap ◽  
Stanislav Jendrol’
Keyword(s):  
Edge Coloring ◽  
Plane Graphs

scholarly journals Facial rainbow edge-coloring of simple 3-connected plane graphs

2020 ◽  
Vol 40 (4) ◽  
pp. 475-482
Author(s):  
Július Czap
Keyword(s):  
Edge Coloring ◽  
Plane Graph ◽  
Plane Graphs ◽  
Minimum Number

A facial rainbow edge-coloring of a plane graph \(G\) is an edge-coloring such that any two edges receive distinct colors if they lie on a common facial path of \(G\). The minimum number of colors used in such a coloring is denoted by \(\text{erb}(G)\). Trivially, \(\text{erb}(G) \geq \text{L}(G)+1\) holds for every plane graph without cut-vertices, where \(\text{L}(G)\) denotes the length of a longest facial path in \(G\). Jendroľ in 2018 proved that every simple \(3\)-connected plane graph admits a facial rainbow edge-coloring with at most \(\text{L}(G)+2\) colors, moreover, this bound is tight for \(\text{L}(G)=3\). He also proved that \(\text{erb}(G) = \text{L}(G)+1\) for \(\text{L}(G)\not\in\{3,4,5\}\). He posed the following conjecture: There is a simple \(3\)-connected plane graph \(G\) with \(\text{L}(G)=4\) and \(\text{erb}(G)=\text{L}(G)+2\). In this note we answer the conjecture in the affirmative.

scholarly journals Facial non-repetitive edge-coloring of plane graphs

2010 ◽  
Vol 66 (1) ◽  
pp. 38-48 ◽  
Author(s):  
Frédéric Havet ◽  
Stanislav Jendrol' ◽  
Roman Soták ◽  
Erika Škrabul'áková
Keyword(s):  
Edge Coloring ◽  
Plane Graphs

Facial Rainbow Edge-Coloring of Plane Graphs

2018 ◽  
Vol 34 (4) ◽  
pp. 669-676 ◽  
Author(s):  
Stanislav Jendrol’
Keyword(s):  
Edge Coloring ◽  
Plane Graphs

scholarly journals Facial anagram-free edge-coloring of plane graphs

2017 ◽  
Vol 230 ◽  
pp. 151-155 ◽  
Author(s):  
Július Czap ◽  
Stanislav Jendrol’ ◽  
Roman Soták
Keyword(s):  
Edge Coloring ◽  
Free Edge ◽  
Plane Graphs

Super Graceful Labeling for Some Simple Graphs

2012 ◽  
Vol 2 (1) ◽  
pp. 35 ◽  
Author(s):  
M. A. Perumal ◽  
S. Navaneethakrishnan ◽  
A. Nagaraja ◽  
S. Arockiaraj
Keyword(s):  
Graceful Labeling ◽  
Simple Graphs

A STUDY ON FUZZY EQUITABLE EDGE COLORING OF WHEEL RELATED GRAPHS

2020 ◽  
Vol 9 (11) ◽  
pp. 9311-9317
Author(s):  
K. Sivaraman ◽  
R.V. Prasad
Keyword(s):  
Edge Coloring ◽  
Graph Labeling ◽  
Equitable Edge Coloring

Equitable edge coloring is a kind of graph labeling with the following restrictions. No two adjacent edges receive same label (color). and number of edges in any two color classes differ by at most one. In this work we are going to present the Fuzzy equitable edge coloring of some wheel related graphs.

Sign in / Sign up

Export Citation Format

Share Document