Old Web
English
Sign In
Acemap
>
Paper
>
Computing the Edge-Neighbour-Scattering Number of Graphs
Computing the Edge-Neighbour-Scattering Number of Graphs
2013
Zongtian Wei
Nannan Qi
Xiaokui Yue
Keywords:
Trapezoid graph
Combinatorics
1-planar graph
Nuclear magnetic resonance
Partial k-tree
Indifference graph
Odd graph
Chordal graph
Clique-sum
Pathwidth
Chemistry
Maximal independent set
Dense graph
Discrete mathematics
Correction
Source
Cite
Save
Machine Reading By IdeaReader
0
References
1
Citations
NaN
KQI
[]