Ning Song

Follow

Generating author description...

Common Coauthors
Commonly Cited References
Action Title Year Authors # of times referenced
+ A resultant approach to detect intersecting curves in $\PP^3$ 2003 Laurent Busé
André Galligo
1
+ Multiplication maps of linear systems on smooth projective toric surfaces 2002 Najmuddin Fakhruddin
1
+ Strong chromatic index of subcubic planar multigraphs 2015 Alexandr Kostochka
X. Li
Watcharintorn Ruksasakchai
Michael Santana
Tao Wang
Gexin Yu
1
+ Strong Chromatic Index of 2-Degenerate Graphs 2012 Gerard J. Chang
N. Narayanan
1
+ Strong Chromatic Index of Sparse Graphs 2015 Daqing Yang
Xuding Zhu
1
+ Every Planar Graph with Maximum Degree 7 Is of Class 1 2000 Limin Zhang
1
+ Upper bounds on the<mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" altimg="si1.gif" display="inline" overflow="scroll"><mml:mi>k</mml:mi></mml:math>-forcing number of a graph 2014 David Amos
Yair Caro
Randy Davila
Ryan Pepper
1
+ Vertex and edge spread of zero forcing number, maximum nullity, and minimum rank of a graph 2010 Christina J. Edholm
Leslie Hogben
My Huynh
Joshua LaGrange
Darren D. Row
1
+ On the Validity of Implicitization by Moving Quadrics for Rational Surfaces with No Base Points 2000 David Cox
Ronald Goldman
Ming Zhang
1
+ Spanning trees with many leaves 2011 D. V. Karpov
1
+ A new implicit representation of a planar rational curve with high order singularity 2002 Falai Chen
Tom Sederberg
1
+ The resultant of an unmixed bivariate system 2003 Amit Khetan
1
+ The moving line ideal basis of planar rational curves 1998 David A. Cox
Thomas W. Sederberg
Falai Chen
1
+ PDF Chat Full Control by Locally Induced Relaxation 2007 Daniel Burgarth
Vittorio Giovannetti
1
+ Strong edge-colouring of sparse planar graphs 2014 Julien Bensmail
Ararat Harutyunyan
Hervé Hocquard
Petru Valicov
1
+ Rectangular corner cutting and Sylvester A-resultants 2000 Ming Zhang
Ron Goldman
1
+ PDF Chat Zero forcing parameters and minimum rank problems 2010 Francesco Barioli
Wayne Barrett
Shaun Fallat
H. Tracy Hall
Leslie Hogben
Bryan L. Shader
P. van den Driessche
Hein van der Holst
1
+ PDF Chat Parameters Related to Tree‐Width, Zero Forcing, and Maximum Nullity of a Graph 2012 Francesco Barioli
Wayne Barrett
Shaun Fallat
H. Tracy Hall
Leslie Hogben
Bryan L. Shader
P. van den Driessche
Hein van der Holst
1
+ Implicitization by Dixon A-resultants 2000 Eng-Wee Chionh
Ming Zhang
Ron Goldman
1
+ The -sided toric patches and -resultants 2000 Severinas Zub≐
1
+ PDF Chat Vanishing theorems on toric varieties 2002 Mircea Mustaţă
1
+ Induced matchings in cubic graphs 1993 Peter Horák
Qing He
William T. Trotter
1
+ PDF Chat 2-Factors in claw-free graphs with locally disconnected vertices 2015 Mingqiang An
Liming Xiong
Runli Tian
1
+ On partitioning the edges of 1-plane graphs 2016 William Lenhart
Giuseppe Liotta
Fabrizio Montecchiani
1
+ Toric Varieties and Toric Resolutions 2000 David A. Cox
1
+ Strong chromatic index of graphs 2015 Michaĺ Deͅbski
1
+ Extremal values and bounds for the zero forcing number 2016 Michael Gentner
Lúcia Draque Penso
Dieter Rautenbach
Uéverton S. Souza
1
+ PDF Chat Coloring plane graphs with independent crossings 2009 Daniel Kráľ
Ladislav Stacho
1
+ Grundy dominating sequences and zero forcing sets 2017 Boštjan Brešar
Csilla Bujtás
Tanja Gologranc
Sandi Klavžar
Gašper Košmrlj
Balázs Patkós
Źsolt Tuza
Máté Vizer
1
+ PDF Chat A Stronger Bound for the Strong Chromatic Index 2017 Henning Bruhn
Felix Joos
1
+ Strong chromatic index of K4-minor free graphs 2017 Yiqiao Wang
Ping Wang
Weifan Wang
1
+ Total forcing sets and zero forcing sets in trees 2018 Randy Davila
Michael A. Henning
1
+ PDF Chat Colouring graphs with sparse neighbourhoods: Bounds and applications 2022 Marthe Bonamy
Thomas Perrett
Luke Postle
1
+ Zero forcing number of a graph in terms of the number of pendant vertices 2018 Xinlei Wang
Dein Wong
Yuanshuai Zhang
1
+ PDF Chat The Zero Forcing Number of Graphs 2019 Thomas Kalinowski
Nina Kamčev
Benny Sudakov
1
+ Strong edge-colorings for k-degenerate graphs 2012 Gexin Yu
1
+ On the total forcing number of a graph 2018 Randy Davila
Michael A. Henning
1
+ Strong Chromatic Index of Graphs With Maximum Degree Four 2018 Mingfang Huang
Michael Santana
Gexin Yu
1
+ PDF Chat Bounds on the Connected Forcing Number of a Graph 2018 Randy Davila
Michael A. Henning
Colton Magnant
Ryan Pepper
1
+ PDF Chat Zero Forcing in Claw-Free Cubic Graphs 2018 Randy Davila
Michael A. Henning
1
+ PDF Chat Total Forcing and Zero Forcing in Claw-Free Cubic Graphs 2018 Randy Davila
Michael A. Henning
1
+ Complexity and computation of connected zero forcing 2017 Boris Brimkov
Illya V. Hicks
1
+ Some bounds on the zero forcing number of a graph 2017 Michael Gentner
Dieter Rautenbach
1
+ Maximum nullity and zero forcing number on graphs with maximum degree at most three 2020 Meysam Alishahi
Elahe Rezaei-Sani
Elahe Sharifi
1
+ PDF Chat An improved procedure for colouring graphs of bounded local density 2021 Eoin Hurley
Rémi de Joannis de Verclos
Ross J. Kang
1
+ Probabilistic zero forcing on random graphs 2020 Sean English
Calum MacRury
Paweł Prałat
1
+ 5-choosability of graphs with crossings far apart 2016 Zdeněk Dvořák
Bernard Lidický
Bojan Mohar
1
+ PDF Chat Nondiscriminatory propagation on trees 2008 Simone Severini
1
+ PDF Chat On the Zero Forcing Number and Spectral Radius of Graphs 2022 Wenqian Zhang
Jianfeng Wang
Weifan Wang
Shengjin Ji
1
+ Coupled choosability of plane graphs 2008 Weifan Wang
Ko‐Wei Lih
1