Reinforcing a Matroid to Have k Disjoint Bases

Journals Menu

Follow SCIRP

	customer@scirp.org
	+86 18163351462(WhatsApp)
	1655362766

	Paper Publishing WeChat

Applied Mathematics

ISSN Print: 2152-7385
ISSN Online: 2152-7393
www.scirp.org/journal/am
E-mail: am@scirp.org

Google-based Impact Factor: 0.96
Citations

Journals Menu

"Reinforcing a Matroid to Have k Disjoint Bases"
written by Hong-Jian Lai, Ping Li, Yanting Liang, Jinquan Xu,
published by Applied Mathematics, Vol.1 No.3, 2010

has been cited by the following article(s):

Google Scholar
CrossRef

[1]	Circuits and Cycles in Graphs and Matroids
	2020

[2]	Collapsible subgraphs of a 4-edge-connected graph
	2019

[3]	Research Prospectus
	2018

[4]	Group Connectivity and Modulo Orientations of Graphs
	ProQuest Dissertations Publishing, 2018

[5]	A Study on Graph Coloring and Digraph Connectivity
	ProQuest Dissertations Publishing, 2018

[6]	Supereulerian width of dense graphs
	Discrete Mathematics, 2017

[7]	Nowhere‐zero 3‐flow and Z3‐connectedness in graphs with four edge‐disjoint spanning trees
	Graph Theory, 2017

[8]	Nowhere-zero 3-flow and ℤ𝟑-connectedness in graphs with four edge-disjoint spanning trees
	Journal of Graph Theory, 2017

[9]	Nowhere‐zero 3‐flow and‐connectedness in graphs with four edge‐disjoint spanning trees
	Journal of Graphy Theory, 2016

[10]	Nowhere-zero $3 $-flow and $\ mathbb {Z} _3 $-connectedness in Graphs with Four Edge-disjoint Spanning Trees
	2016

[11]	Supereulerian graphs with width s and s-collapsible graphs
	Discrete Applied Mathematics, 2015

[12]	Characterizations of minimal graphs with equal edge connectivity and spanning tree packing number
	arXiv preprint arXiv:1410.5486, 2014

[13]	Xiaofeng Gu, Hong-Jian Lai, Ping Li &
	Graphs and Combinatorics, 2014

[14]	Characterizations of strength extremal graphs
	Graphs and Combinatorics, 2014

[15]	Modeling and tuning of energy harvesting device using piezoelectric cantilever array
	2014

[16]	On spanning disjoint paths in line graphs
	Graphs and Combinatorics, 2013

[17]	Ye Chen, Zhi-Hong Chen, Hong-Jian
	Graphs and Combinatorics, 2013

[18]	Connectivity and spanning trees of graphs
	ProQuest Dissertations Publishing, 2013

[19]	Cycles, Disjoint Spanning Trees and Orientations of Graphs
	ProQuest Dissertations Publishing, 2012

[20]	Cycles and bases of graphs and matroids
	2012

[21]	Degree sequences and graphs with disjoint spanning trees
	Discrete Applied Mathematics, 2011

[1]	Collapsible subgraphs of a 4-edge-connected graph Discrete Applied Mathematics, 2019 DOI:10.1016/j.dam.2019.01.033

[2]	Collapsible subgraphs of a 4-edge-connected graph Discrete Applied Mathematics, 2019 DOI:10.1016/j.dam.2019.01.033

[3]	Collapsible subgraphs of a 4-edge-connected graph Discrete Applied Mathematics, 2019 DOI:10.1016/j.dam.2019.01.033

[4]	Collapsible subgraphs of a 4-edge-connected graph Discrete Applied Mathematics, 2019 DOI:10.1016/j.dam.2019.01.033

[5]	Nowhere‐zero 3‐flow and ‐connectedness in graphs with four edge‐disjoint spanning trees Journal of Graph Theory, 2018 DOI:10.1002/jgt.22231

[6]	Supereulerian width of dense graphs Discrete Mathematics, 2017 DOI:10.1016/j.disc.2017.07.015

[7]	Nowhere-zero 3-flow and Z3-connectedness in graphs with four edge-disjoint spanning trees Journal of Graph Theory, 2017 DOI:10.1002/jgt.22231

[8]	Supereulerian graphs with width s and s-collapsible graphs Discrete Applied Mathematics, 2016 DOI:10.1016/j.dam.2015.07.013

[9]	Characterizations of Strength Extremal Graphs Graphs and Combinatorics, 2014 DOI:10.1007/s00373-013-1359-z

[10]	On Spanning Disjoint Paths in Line Graphs Graphs and Combinatorics, 2013 DOI:10.1007/s00373-012-1237-0

[11]	Degree sequences and graphs with disjoint spanning trees Discrete Applied Mathematics, 2011 DOI:10.1016/j.dam.2011.05.009

Follow SCIRP

	customer@scirp.org
	+86 18163351462(WhatsApp)
	1655362766

	Paper Publishing WeChat

Applied Mathematics

Applied Mathematics

Journals Menu

Home

About SCIRP

Service

Policies