X
Search Filters
Format Format
Subjects Subjects
Subjects Subjects
X
Sort by Item Count (A-Z)
Filter by Count
graphs (3) 3
mathematics (3) 3
adjacent vertex distinguishing incidence chromatic number (2) 2
adjacent vertex distinguishing incidence coloring (2) 2
coloring (2) 2
05c15 (1) 1
1-2-3 conjecture (1) 1
1–2–3 conjecture (1) 1
[ info.info-dm ] computer science [cs]/discrete mathematics [cs.dm] (1) 1
[ math.math-co ] mathematics [math]/combinatorics [math.co] (1) 1
adjacent strong chromatic index (1) 1
adjacent vertex distinguishing edge coloring (1) 1
adjacent vertex-distinguishing edge coloring (1) 1
adjacent vertex-distinguishing equitable edge coloring (1) 1
applications of mathematics (1) 1
cartesian (1) 1
channel assignment (1) 1
chromatic number (1) 1
colors (1) 1
computer science - discrete mathematics (1) 1
cylinders and tori (1) 1
discharging method (1) 1
distinguishing edge colorings (1) 1
electrical engineering (1) 1
engineering (1) 1
graph (1) 1
graph theory (1) 1
grids (1) 1
hexagonal lattice (1) 1
ieee 802.11 (1) 1
incidence (1) 1
incidence-adjacent vertex distinguishing equitable total chromatic number (1) 1
incidence-adjacent vertex distinguishing equitable total coloring (1) 1
infinite planar graphs (1) 1
integers (1) 1
irregularity strength (1) 1
lattices (1) 1
math applications in computer science (1) 1
mathematics - combinatorics (1) 1
mathematics, applied (1) 1
mesh networks (1) 1
mycielski graph (1) 1
neighbor sum distinguishing index (1) 1
planar graph (1) 1
rural mesh networks (1) 1
theoretical, mathematical and computational physics (1) 1
tn911 (1) 1
uv (1) 1
ve (1) 1
最小值 (1) 1
点可区别边色数 (1) 1
边染色 (1) 1
邻点可区别 (1) 1
more...
Language Language
Publication Date Publication Date
Click on a bar to filter by decade
Slide to change publication date range


Ars Combinatoria, ISSN 0381-7032, 07/2018, Volume 140, pp. 251 - 265
We study incidence coloring of graphs in which adjacent vertices are distinguished by their sets of the colors which assigned to their incidences and show that... 
Grids | Adjacent vertex distinguishing incidence coloring | Cylinders and tori | Adjacent vertex distinguishing incidence chromatic number | cylinders and tori | MATHEMATICS | grids | adjacent vertex distinguishing incidence chromatic number | GRAPHS
Journal Article
Applied Mechanics and Materials, ISSN 1660-9336, 03/2014, Volume 543-547, Issue Vehicle, Mechatronics and Information Technologies II, pp. 1769 - 1772
An adjacent vertex distinguishing incidence coloring of graph of G is an incidence coloring of G such that no pair of adjacent vertices meets the same set of... 
Adjacent vertex distinguishing incidence coloring | Adjacent vertex distinguishing incidence chromatic number | Infinite planar graphs | Cartesian | Hexagonal lattice | Coloring | Colors (materials) | Lattices | Graphs | Incidence
Journal Article
应用数学学报:英文版, ISSN 0168-9673, 2013, Volume 29, Issue 3, pp. 615 - 622
Let G(V, E) be a graph. A k-adjacent vertex-distinguishing equatable edge coloring of G, k-AVEEC for short, is a proper edge coloring f if (1) C(u)≠C(v) for... 
边染色 | UV | 最小值 | 邻点可区别 | 点可区别边色数 | VE | adjacent vertex-distinguishing edge coloring | Theoretical, Mathematical and Computational Physics | Mathematics | Applications of Mathematics | Math Applications in Computer Science | adjacent vertex-distinguishing equitable edge coloring | graph | 05C15 | MATHEMATICS, APPLIED | CHROMATIC NUMBER
Journal Article
电子科学学刊:英文版, ISSN 0217-9822, 2013, Volume 30, Issue 5, pp. 436 - 446
IEEE 802.11 based wireless mesh networks with directional antennas are expected to be a new promising technology and an economic approach for providing... 
IEEE 802.11 | Engineering | Channel assignment | Adjacent Vertex Distinguishing Edge Coloring (AVDEC) | TN911 | Electrical Engineering | Rural mesh networks | Mesh networks
Journal Article
Journal of Graph Theory, ISSN 0364-9024, 07/2017, Volume 85, Issue 3, pp. 669 - 690
Let c be a proper edge coloring of a graph G=(V,E) with integers 1,2,…,k. Then k≥Δ(G), while Vizing's theorem guarantees that we can take k≤Δ(G)+1. On the... 
neighbor sum distinguishing index | planar graph | adjacent strong chromatic index | 1–2–3 Conjecture | discharging method | 1-2-3 Conjecture | MATHEMATICS | IRREGULARITY STRENGTH | DISTINGUISHING EDGE COLORINGS
Journal Article
No results were found for your search.

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