Xueliang Li

Eur. J. Comb., 2026

On the relationship between (Af)α-spectral radii of graphs with starlike branch tree or bouquet branch graph and its linearly order.

[BibT_eX]

[DOI]

Ruiling Zheng

Discret. Math., 2026

Spectral radius of graphs of given size with a forbidden fan graph F6.

[BibT_eX]

[DOI]

Jing Gao

Discret. Math., 2026

Rainbow and Gallai-Rado numbers involving binary function equations.

[BibT_eX]

[DOI]

Yuan Si

Discret. Appl. Math., 2026

On the local metric dimension of K 5 -free graphs.

[BibT_eX]

[DOI]

Ali Ghalavand

Discret. Appl. Math., 2026

The maximum spectral radius of graphs without a theta subgraph.

[BibT_eX]

[DOI]

Jing Gao

Discret. Appl. Math., 2026

2025

Gallai-Ramsey numbers for rainbow trees and monochromatic complete bipartite graphs.

[BibT_eX]

[DOI]

Discuss. Math. Graph Theory, 2025

Rainbow directed version of Dirac's theorem.

[BibT_eX]

[DOI]

Discret. Math., 2025

The Li-Feng transformation of weighted adjacency matrices for graphs with degree-based edge-weights.

[BibT_eX]

[DOI]

Discret. Math., 2025

Extremal results on the spectral radius of function-weighted adjacency matrices.

[BibT_eX]

[DOI]

Ruiling Zheng

Discret. Appl. Math., 2025

On maximum induced forests of the balanced bipartite graphs.

[BibT_eX]

[DOI]

Ali Ghalavand

Discret. Appl. Math., 2025

Maximum energy bicyclic graphs containing two odd cycles with one common vertex.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2025

Every Signed Planar Graph of Girth 5 Has Circular Chromatic Number Strictly Less Than 4.

[BibT_eX]

[DOI]

Zhiqian Wang

Electron. J. Comb., 2025

2024

Gallai-Ramsey Multiplicity for Rainbow Small Trees.

[BibT_eX]

[DOI]

Yuan Si

Graphs Comb., August, 2024

Gallai-Ramsey numbers for 3-uniform rainbow Berge triangles and monochromatic linear paths or cycles.

[BibT_eX]

[DOI]

Yuan Si

Discret. Appl. Math., February, 2024

Counting rainbow triangles in edge-colored graphs.

[BibT_eX]

[DOI]

J. Graph Theory, 2024

Vertex-bipancyclicity in a bipartite graph collection.

[BibT_eX]

[DOI]

Discret. Math., 2024

Edge-disjoint properly colored cycles in edge-colored complete graphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2024

2023

Rainbow structures in a collection of graphs with degree conditions.

[BibT_eX]

[DOI]

J. Graph Theory, October, 2023

Some interlacing results on weighted adjacency matrices of graphs with degree-based edge-weights.

[BibT_eX]

[DOI]

Ning Yang

Discret. Appl. Math., July, 2023

Extremal graphs and classification of planar graphs by MC-numbers.

[BibT_eX]

[DOI]

Yanhong Gao

Discuss. Math. Graph Theory, 2023

Monochromatic-degree conditions for properly colored cycles in edge-colored complete graphs.

[BibT_eX]

[DOI]

Discret. Math., 2023

2022

The Flow Index of Regular Class I Graphs.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., September, 2022

Rainbow edge-pancyclicity of strongly edge-colored graphs.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2022

The proper vertex-disconnection of graphs.

[BibT_eX]

[DOI]

You Chen

Theor. Comput. Sci., 2022

Monochromatic disconnection: Erdős-Gallai-type problems and product graphs.

[BibT_eX]

[DOI]

J. Comb. Optim., 2022

Further results on the total monochromatic connectivity of graphs.

[BibT_eX]

[DOI]

Yanhong Gao

J. Comb. Optim., 2022

Note on Rainbow Triangles in Edge-Colored Graphs.

[BibT_eX]

[DOI]

Bo Ning

Graphs Comb., 2022

More on the rainbow disconnection in graphs.

[BibT_eX]

[DOI]

Discuss. Math. Graph Theory, 2022

Vertex-disjoint rainbow cycles in edge-colored graphs.

[BibT_eX]

[DOI]

Discret. Math., 2022

Note on rainbow cycles in edge-colored graphs.

[BibT_eX]

[DOI]

Discret. Math., 2022

Edge-disjoint rainbow triangles in edge-colored graphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2022

2021

Digraphs with proper connection number two.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2021

Group connectivity under 3-edge-connectivity.

[BibT_eX]

[DOI]

J. Graph Theory, 2021

Complexity results for two kinds of colored disconnections of graphs.

[BibT_eX]

[DOI]

J. Comb. Optim., 2021

Conflict-free connection of trees.

[BibT_eX]

[DOI]

J. Comb. Optim., 2021

Rainbow Monochromatic k-Edge-Connection Colorings of Graphs.

[BibT_eX]

[DOI]

Graphs Comb., 2021

On proper (strong) rainbow connection of graphs.

[BibT_eX]

[DOI]

Discuss. Math. Graph Theory, 2021

The vertex- rainbow connection number of some graph operations.

[BibT_eX]

[DOI]

Yingbin Ma

Discuss. Math. Graph Theory, 2021

Upper bounds for the MD-numbers and characterization of extremal graphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2021

Monochromatic disconnection of graphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2021

Proper vertex-pancyclicity of edge-colored complete graphs without joint monochromatic triangles.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2021

On the eigenvalue and energy of extended adjacency matrix.

[BibT_eX]

[DOI]

Appl. Math. Comput., 2021

2020

(Strong) conflict-free connectivity: Algorithm and complexity.

[BibT_eX]

[DOI]

Meng Ji

Theor. Comput. Sci., 2020

Hardness results for three kinds of colored connections of graphs.

[BibT_eX]

[DOI]

Zhong Huang

Theor. Comput. Sci., 2020

Analysis of the Graovac-Pisanski Index of Some Polyhedral Graphs Based on Their Symmetry Group.

[BibT_eX]

[DOI]

Modjtaba Ghorbani

Mardjan Hakimi-Nezhaad

Matthias Dehmer

Symmetry, 2020

More on limited packings in graphs.

[BibT_eX]

[DOI]

Xuqing Bai

Hong Chang

J. Comb. Optim., 2020

Spanning Triangle-Trees and Flows of Graphs.

[BibT_eX]

[DOI]

Graphs Comb., 2020

Conflict-free vertex-connections of graphs.

[BibT_eX]

[DOI]

Discuss. Math. Graph Theory, 2020

Complementary graphs with flows less than three.

[BibT_eX]

[DOI]

Discret. Math., 2020

Monochromatic k-edge-connection colorings of graphs.

[BibT_eX]

[DOI]

Discret. Math., 2020

Extremal graphs with maximum monochromatic connectivity.

[BibT_eX]

[DOI]

Yirong Yang

Discret. Math., 2020

Compatible spanning circuits in edge-colored graphs.

[BibT_eX]

[DOI]

Discret. Math., 2020

The asymptotic value of graph energy for random graphs with degree-based weights.

[BibT_eX]

[DOI]

Yiyang Li

Jiarong Song

Discret. Appl. Math., 2020

Conflict-free connection number of random graphs.

[BibT_eX]

[DOI]

Ran Gu

Discret. Appl. Math., 2020

Strong rainbow disconnection in graphs.

[BibT_eX]

[DOI]

Xuqing Bai

CoRR, 2020

Graph colorings under global structural conditions.

[BibT_eX]

[DOI]

Xuqing Bai

CoRR, 2020

Strong conflict-free connection of graphs.

[BibT_eX]

[DOI]

Meng Ji

Appl. Math. Comput., 2020

Conflict-free (vertex-)connection numbers of graphs with small diameters.

[BibT_eX]

[DOI]

Australas. J Comb., 2020

Complexity Results for the Proper Disconnection of Graphs.

[BibT_eX]

[DOI]

Proceedings of the Frontiers in Algorithmics - 14th International Workshop, 2020

2019

Minimum degree condition for proper connection number 2.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2019

Skew-rank of an oriented graph and independence number of its underlying graph.

[BibT_eX]

[DOI]

Wen Xia

J. Comb. Optim., 2019

Erdős-Gallai-type results for total monochromatic connection of graphs.

[BibT_eX]

[DOI]

Discuss. Math. Graph Theory, 2019

Kaleidoscopic edge-coloring of complete graphs and r-regular graphs.

[BibT_eX]

[DOI]

Discuss. Math. Graph Theory, 2019

On conflict-free connection of graphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2019

2018

The (k , ℓ)-proper index of graphs.

[BibT_eX]

[DOI]

J. Comb. Optim., 2018

Some extremal results on the colorful monochromatic vertex-connectivity of a graph.

[BibT_eX]

[DOI]

J. Comb. Optim., 2018

Graphs with Conflict-Free Connection Number Two.

[BibT_eX]

[DOI]

Graphs Comb., 2018

Rainbow vertex-connection and forbidden subgraphs.

[BibT_eX]

[DOI]

Jingshu Zhang

Discuss. Math. Graph Theory, 2018

Inverse problem on the Steiner Wiener index.

[BibT_eX]

[DOI]

Ivan Gutman

Discuss. Math. Graph Theory, 2018

Generalized rainbow connection of graphs and their complements.

[BibT_eX]

[DOI]

Discuss. Math. Graph Theory, 2018

Compatible Eulerian circuits in Eulerian (di)graphs with generalized transition systems.

[BibT_eX]

[DOI]

Discret. Math., 2018

Hardness results for rainbow disconnection of graphs.

[BibT_eX]

[DOI]

Zhong Huang

CoRR, 2018

Conflict-free connections: algorithm and complexity.

[BibT_eX]

[DOI]

Meng Ji

CoRR, 2018

More on total monochromatic connection of graphs.

[BibT_eX]

Ars Comb., 2018

Non-jumping numbers for 5-uniform hypergraphs.

[BibT_eX]

[DOI]

Appl. Math. Comput., 2018

On extremal graphs with exactly one Steiner tree connecting any k vertices.

[BibT_eX]

[DOI]

Australas. J Comb., 2018

On various (strong) rainbow connection numbers of graphs.

[BibT_eX]

[DOI]

Australas. J Comb., 2018

2017

On the difference of two generalized connectivities of a graph.

[BibT_eX]

[DOI]

J. Comb. Optim., 2017

The (vertex-)monochromatic index of a graph.

[BibT_eX]

[DOI]

J. Comb. Optim., 2017

Upper bounds of proper connection number of graphs.

[BibT_eX]

[DOI]

Fei Huang

Shujing Wang

J. Comb. Optim., 2017

A solution to a conjecture on the generalized connectivity of graphs.

[BibT_eX]

[DOI]

J. Comb. Optim., 2017

Improved upper bound for the degenerate and star chromatic numbers of graphs.

[BibT_eX]

[DOI]

Jiansheng Cai

Guiying Yan

J. Comb. Optim., 2017

Erdős-Gallai-type results for colorful monochromatic connectivity of a graph.

[BibT_eX]

[DOI]

J. Comb. Optim., 2017

3-Rainbow Index and Forbidden Subgraphs.

[BibT_eX]

[DOI]

Jingshu Zhang

Graphs Comb., 2017

Rainbow connection number of graphs with diameter 3.

[BibT_eX]

[DOI]

Discuss. Math. Graph Theory, 2017

Total monochromatic connection of graphs.

[BibT_eX]

[DOI]

Discret. Math., 2017

On two conjectures about the proper connection number of graphs.

[BibT_eX]

[DOI]

Discret. Math., 2017

The von Neumann entropy of random multipartite graphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2017

Hardness result for the total rainbow k-connection of graphs.

[BibT_eX]

[DOI]

Appl. Math. Comput., 2017

The k-proper index of graphs.

[BibT_eX]

[DOI]

Lin Chen

Jinfeng Liu

Appl. Math. Comput., 2017

The k-proper index of complete bipartite and complete multipartite graphs.

[BibT_eX]

[DOI]

Jingshu Zhang

Australas. J Comb., 2017

Conflict-Free Connection Numbers of Line Graphs.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Optimization and Applications, 2017

2016

Proper connection number of random graphs.

[BibT_eX]

[DOI]

Ran Gu

Zhongmei Qin

Theor. Comput. Sci., 2016

Construction of quantum caps in projective space PG(r, 4) and quantum codes of distance 4.

[BibT_eX]

[DOI]

Quantum Inf. Process., 2016

Upper bounds for the total rainbow connection of graphs.

[BibT_eX]

[DOI]

J. Comb. Optim., 2016

Some Motzkin-Straus type results for non-uniform hypergraphs.

[BibT_eX]

[DOI]

J. Comb. Optim., 2016

The 3-rainbow index and connected dominating sets.

[BibT_eX]

[DOI]

J. Comb. Optim., 2016

Rainbow Connection Number and Independence Number of a Graph.

[BibT_eX]

[DOI]

Jiuying Dong

Graphs Comb., 2016

Graphs with large generalized (edge-)connectivity.

[BibT_eX]

[DOI]

Discuss. Math. Graph Theory, 2016

The Steiner Wiener index of a graph.

[BibT_eX]

[DOI]

Ivan Gutman

Discuss. Math. Graph Theory, 2016

Note on the upper bound of the rainbow index of a graph.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2016

2015

Proper connection number and connected dominating sets.

[BibT_eX]

[DOI]

Meiqin Wei

Jun Yue

Theor. Comput. Sci., 2015

On entanglement-assisted quantum codes achieving the entanglement-assisted Griesmer bound.

[BibT_eX]

[DOI]

Luobin Guo

Quantum Inf. Process., 2015

On Extremal Graphs with at Most ℓ Internally Disjoint Steiner Trees Connecting Any n-1 Vertices.

[BibT_eX]

[DOI]

Graphs Comb., 2015

Rainbow Connection Number and the Number of Blocks.

[BibT_eX]

[DOI]

Graphs Comb., 2015

Polynomial reconstruction of the matching polynomial.

[BibT_eX]

[DOI]

Martin Trinks

Electron. J. Graph Theory Appl., 2015

Graphs with 4-rainbow index 3 and n-1.

[BibT_eX]

[DOI]

Discuss. Math. Graph Theory, 2015

Graphs with 3-rainbow index n-1 and n-2.

[BibT_eX]

[DOI]

Discuss. Math. Graph Theory, 2015

The 3-rainbow index of a graph.

[BibT_eX]

[DOI]

Discuss. Math. Graph Theory, 2015

Note on the spanning-tree packing number of lexicographic product graphs.

[BibT_eX]

[DOI]

Discret. Math., 2015

Nordhaus-Gaddum-type results for the generalized edge-connectivity of graphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2015

The matching energy of random graphs.

[BibT_eX]

[DOI]

Xiaolin Chen

Discret. Appl. Math., 2015

A survey of recent results in (generalized) graph entropies.

[BibT_eX]

[DOI]

Meiqin Wei

CoRR, 2015

Connections between generalized graph entropies and graph energy.

[BibT_eX]

[DOI]

Matthias Dehmer

Complex., 2015

Solution to a Conjecture on the Maximum Skew-Spectral Radius of Odd-Cycle Graphs.

[BibT_eX]

[DOI]

Xiaolin Chen

Electron. J. Comb., 2015

Note on a Turan-type problem on distances.

[BibT_eX]

Ars Comb., 2015

The minimal size of a graph with given generalized 3-edge-connectivity.

[BibT_eX]

Ars Comb., 2015

An improved Fan-Type degree condition for k-linked graphs.

[BibT_eX]

Jiuying Dong

Ars Comb., 2015

Novel inequalities for generalized graph entropies - Graph energies and topological indices.

[BibT_eX]

[DOI]

Appl. Math. Comput., 2015

Note on the complexity of deciding the rainbow (vertex-) connectedness for bipartite graphs.

[BibT_eX]

[DOI]

Appl. Math. Comput., 2015

On graphs with maximum Harary spectral radius.

[BibT_eX]

[DOI]

Fei Huang

Shujing Wang

Appl. Math. Comput., 2015

On shortening construction of self-orthogonal quaternary codes.

[BibT_eX]

[DOI]

Proceedings of the Seventh International Workshop on Signal Design and its Applications in Communications, 2015

Searching for (near) Optimal Codes.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Optimization and Applications, 2015

2014

Note on Minimally d-Rainbow Connected Graphs.

[BibT_eX]

[DOI]

Graphs Comb., 2014

The (revised) Szeged index and the Wiener index of a nonbipartite graph.

[BibT_eX]

[DOI]

Eur. J. Comb., 2014

The generalized 3-connectivity of Lexicographic product graphs.

[BibT_eX]

[DOI]

Discret. Math. Theor. Comput. Sci., 2014

Oriented diameter and rainbow connection number of a graph.

[BibT_eX]

[DOI]

Discret. Math. Theor. Comput. Sci., 2014

Tight upper bound of the rainbow vertex-connection number for 2-connected graphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2014

Tricyclic graphs with maximal revised Szeged index.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2014

Additive codes over $GF(4)$ from circulant graphs.

[BibT_eX]

[DOI]

CoRR, 2014

Formally self-dual linear binary codes from circulant graphs.

[BibT_eX]

[DOI]

CoRR, 2014

Note on the generalized connectivity.

[BibT_eX]

Ars Comb., 2014

Rainbow connections for outerplanar graphs with diameter 2 and 3.

[BibT_eX]

[DOI]

Appl. Math. Comput., 2014

Characterize graphs with rainbow connection numbers m-2 and m-3.

[BibT_eX]

[DOI]

Australas. J Comb., 2014

On the generalized (edge-)connectivity of graphs.

[BibT_eX]

[DOI]

Australas. J Comb., 2014

The Generalized 3-Edge-Connectivity of Lexicographic Product Graphs.

[BibT_eX]

[DOI]

Jun Yue

Proceedings of the Combinatorial Optimization and Applications, 2014

2013

Further hardness results on the rainbow vertex-connection number of graphs.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2013

Solutions to conjectures on the (k, ℓ)-rainbow index of complete graphs.

[BibT_eX]

[DOI]

Jiangli Song

Networks, 2013

Rainbow Connections of Graphs: A Survey.

[BibT_eX]

[DOI]

Graphs Comb., 2013

Rainbow Connection in 3-Connected Graphs.

[BibT_eX]

[DOI]

Graphs Comb., 2013

Rainbow Connection Number, Bridges and Radius.

[BibT_eX]

[DOI]

Jiuying Dong

Graphs Comb., 2013

Nordhaus-Gaddum-Type Theorem for Rainbow Connection Number of Graphs.

[BibT_eX]

[DOI]

Graphs Comb., 2013

On the rainbow vertex-connection.

[BibT_eX]

[DOI]

Discuss. Math. Graph Theory, 2013

Rainbow connection number of dense graphs.

[BibT_eX]

[DOI]

Ingo Schiermeyer

Discuss. Math. Graph Theory, 2013

A sharp upper bound for the rainbow 2-connection number of a 2-connected graph.

[BibT_eX]

[DOI]

Discret. Math., 2013

Bicyclic graphs with maximal revised Szeged index.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2013

Skew Spectra of Oriented Bipartite Graphs.

[BibT_eX]

[DOI]

Electron. J. Comb., 2013

2012

Note on the hardness of generalized connectivity.

[BibT_eX]

[DOI]

J. Comb. Optim., 2012

Upper Bounds for the Rainbow Connection Numbers of Line Graphs.

[BibT_eX]

[DOI]

Graphs Comb., 2012

The generalized 3-connectivity of Cartesian product.

[BibT_eX]

[DOI]

Discret. Math. Theor. Comput. Sci., 2012

Rainbow connection of graphs with diameter 2.

[BibT_eX]

[DOI]

Discret. Math., 2012

A survey on the generalized connectivity of graphs

[BibT_eX]

[DOI]

CoRR, 2012

Rainbow Connection Number and Connectivity.

[BibT_eX]

[DOI]

Deepak Rajendraprasad

Electron. J. Comb., 2012

The generalized connectivity of complete bipartite graphs.

[BibT_eX]

Wei Li

Ars Comb., 2012

A solution to a conjecture on two rainbow connection numbers of a graph.

[BibT_eX]

Xiaolin Chen

Ars Comb., 2012

2011

The complexity of determining the rainbow vertex-connection of a graph.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2011

The covering values for acyclic digraph games.

[BibT_eX]

[DOI]

Lei Li

Int. J. Game Theory, 2011

Complete solution to a conjecture on the maximal energy of unicyclic graphs.

[BibT_eX]

[DOI]

Bofeng Huo

Eur. J. Comb., 2011

Rainbow connections for planar graphs and line graphs

[BibT_eX]

[DOI]

Xiaolong Huang

CoRR, 2011

Note on the complexity of deciding the rainbow connectedness for bipartite graphs

[BibT_eX]

[DOI]

CoRR, 2011

Rainbow Connection of Graphs -- A Survey

[BibT_eX]

[DOI]

CoRR, 2011

The complexity of determining the rainbow vertex-connection of graphs

[BibT_eX]

[DOI]

CoRR, 2011

The (strong) rainbow connection numbers of Cayley graphs on Abelian groups.

[BibT_eX]

[DOI]

Comput. Math. Appl., 2011

Note on the Rainbow k-Connectivity of Regular Complete Bipartite Graphs.

[BibT_eX]

Ars Comb., 2011

On the diameter and inverse degree.

[BibT_eX]

Ars Comb., 2011

Rainbow connection numbers of line graphs.

[BibT_eX]

Ars Comb., 2011

Isomorphisms of directed P3-graphs.

[BibT_eX]

Yan Liu

Biao Zhao

Ars Comb., 2011

On the rainbow k-connectivity of complete graphs.

[BibT_eX]

[DOI]

Australas. J Comb., 2011

The minimal size of a graph with generalized connectivity κ3 = 2.

[BibT_eX]

[DOI]

Australas. J Comb., 2011

The asymptotic value of the Randić index for trees.

[BibT_eX]

[DOI]

Yiyang Li

Adv. Appl. Math., 2011

2010

Complete solution to a conjecture on Randic index.

[BibT_eX]

[DOI]

Bolian Liu

Eur. J. Oper. Res., 2010

On a relation between the Randic index and the chromatic number.

[BibT_eX]

[DOI]

Discret. Math., 2010

Trees with a given order and matching number that have maximum general Randic index.

[BibT_eX]

[DOI]

Lingping Zhong

Discret. Math., 2010

Sharp bounds for the generalized connectivity kappa3(G).

[BibT_eX]

[DOI]

Discret. Math., 2010

Hardness results on generalized connectivity

[BibT_eX]

[DOI]

CoRR, 2010

The asymptotic values of the general Zagreb and Randić indices of trees with bounded maximum degree

[BibT_eX]

[DOI]

Yiyang Li

CoRR, 2010

2009

Bipartite rainbow numbers of matchings.

[BibT_eX]

[DOI]

Jianhua Tu

Discret. Math., 2009

Complete solution to a conjecture on the Randic index of triangle-free graphs.

[BibT_eX]

[DOI]

Discret. Math., 2009

Complete solution for the rainbow numbers of matchings.

[BibT_eX]

[DOI]

He Chen

Jianhua Tu

Discret. Math., 2009

On bipartite graphs with minimal energy.

[BibT_eX]

[DOI]

Jianbin Zhang

Discret. Appl. Math., 2009

A proof of a conjecture on the Randic index of graphs with given girth.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2009

The rainbow k-connectivity of two classes of graphs

[BibT_eX]

[DOI]

CoRR, 2009

Anti-Ramsey Numbers for Graphs with Independent Cycles.

[BibT_eX]

[DOI]

Electron. J. Comb., 2009

The heterochromatic matchings in edge-colored bipartite graphs.

[BibT_eX]

Ars Comb., 2009

Complexity of conditional colorability of graphs.

[BibT_eX]

[DOI]

Appl. Math. Lett., 2009

The rainbow number of matchings in regular bipartite graphs.

[BibT_eX]

[DOI]

Zhixia Xu

Appl. Math. Lett., 2009

Weighted Lee Algorithm on Rectilinear Steiner Tree with Obstacles and Boundary.

[BibT_eX]

[DOI]

Yang Luo

Proceedings of the CSIE 2009, 2009 WRI World Congress on Computer Science and Information Engineering, March 31, 2009

2008

Standard Forms of Stabilizer and Normalizer Matrices for Additive Quantum Codes.

[BibT_eX]

[DOI]

Zongben Xu

IEEE Trans. Inf. Theory, 2008

The 2nd-order conditional 3-coloring of claw-free graphs.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2008

On the Determination Problem for P 4-Transformation of Graphs.

[BibT_eX]

[DOI]

Yan Liu

Graphs Comb., 2008

Monochromatic and Heterochromatic Subgraphs in Edge-Colored Graphs - A Survey.

[BibT_eX]

[DOI]

Mikio Kano

Graphs Comb., 2008

Some families of integral graphs.

[BibT_eX]

[DOI]

Discret. Math., 2008

NP-completeness of 4-incidence colorability of semi-cubic graphs.

[BibT_eX]

[DOI]

Jianhua Tu

Discret. Math., 2008

Binary construction of quantum codes of minimum distances five and six.

[BibT_eX]

[DOI]

Discret. Math., 2008

Graphs with the second largest number of maximal independent sets.

[BibT_eX]

[DOI]

Discret. Math., 2008

Heterochromatic tree partition numbers for complete bipartite graphs.

[BibT_eX]

[DOI]

Discret. Math., 2008

The general sigma all-ones problem for trees.

[BibT_eX]

[DOI]

Chao Wang

Xiaoyan Zhang

Discret. Appl. Math., 2008

Partitioning 3-Edge-Colored Complete Equi-Bipartite Graphs by Monochromatic Trees under a Color Degree Condition.

[BibT_eX]

[DOI]

Fengxia Liu

Electron. J. Comb., 2008

Nonexistence of Triples of Nonisomorphic Connected Graphs with Isomorphic Connected P3-graphs.

[BibT_eX]

[DOI]

Yan Liu

Electron. J. Comb., 2008

2007

On the minimum monochromatic or multicolored subgraph partition problems.

[BibT_eX]

[DOI]

Xiaoyan Zhang

Theor. Comput. Sci., 2007

On the complexity of dominating set problems related to the minimum all-ones problem.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2007

Integral trees of diameter 6.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2007

Corrections of proofs for Hansen and Mélot's two theorems.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2007

Connected (n, m)-graphs with minimum and maximum zeroth-order general Randic index.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2007

Dynamic 3-Coloring of Claw-free Graphs

[BibT_eX]

[DOI]

CoRR, 2007

Complexity of the conditional colorability of graphs

[BibT_eX]

[DOI]

Xiangmei Yao

CoRR, 2007

Color Neighborhood Union Conditions for Long Heterochromatic Paths in Edge-Colored Graphs.

[BibT_eX]

[DOI]

He Chen

Electron. J. Comb., 2007

The neighbour-scattering number can be computed in polynomial time for interval graphs.

[BibT_eX]

[DOI]

Comput. Math. Appl., 2007

Chromaticity of the Complements of Some Sparse Graphs.

[BibT_eX]

[DOI]

Haixing Zhao

Ruying Liu

Australas. J Comb., 2007

2006

On the k-path cover problem for cacti.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2006

Partitioning 2-edge-colored complete multipartite graphs into monochromatic cycles, paths and trees.

[BibT_eX]

[DOI]

J. Comb. Optim., 2006

A Characterization of Graphs without Even Factors.

[BibT_eX]

[DOI]

Zhao Zhang

Graphs Comb., 2006

The neighbor-scattering number can be computed in polynomial time for interval graphs

[BibT_eX]

[DOI]

CoRR, 2006

2005

A Combinatorial Algorithm for Minimum Weighted Colorings of Claw-Free Perfect Graphs.

[BibT_eX]

[DOI]

Wenan Zang

J. Comb. Optim., 2005

Rupture degree of graphs.

[BibT_eX]

[DOI]

Yinkui Li

Int. J. Comput. Math., 2005

On problems and conjectures on adjointly equivalent graphs.

[BibT_eX]

[DOI]

Haixing Zhao

Ruying Liu

Discret. Math., 2005

Integral trees with diameters 5 and 6.

[BibT_eX]

[DOI]

Discret. Math., 2005

Long Heterochromatic Paths in Edge-Colored Graphs.

[BibT_eX]

[DOI]

He Chen

Electron. J. Comb., 2005

Two Classes of Integral Regular Graphs.

[BibT_eX]

Cornelis Hoede

Ars Comb., 2005

Two Approaches for the Generalization of Leaf Edge Exchange Graphs on Spanning Trees to Connected Spanning k-Edge Subgraphs of a Graph.

[BibT_eX]

Victor Neumann-Lara

Eduardo Rivera-Campo

Ars Comb., 2005

Matrix method for linear sequential dynamical systems on digraphs.

[BibT_eX]

[DOI]

William Y. C. Chen

Jie Zheng

Appl. Math. Comput., 2005

Paths and cycles in colored graphs.

[BibT_eX]

[DOI]

Australas. J Comb., 2005

Computational complexity and bounds for neighbor-scattering number of graphs.

[BibT_eX]

[DOI]

Proceedings of the 8th International Symposium on Parallel Architectures, 2005

The Binding Number of a Digraph.

[BibT_eX]

[DOI]

Genjiu Xu

Proceedings of the Discrete Geometry, 2005

Sufficient Conditions for the Existence of Perfect Heterochromatic Matchings in Colored Graphs.

[BibT_eX]

[DOI]

Lin Hu

Proceedings of the Discrete Geometry, 2005

2004

Binary Construction of Quantum Codes of Minimum Distance Three and Four.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2004

The Minimum All-Ones Problem for Trees.

[BibT_eX]

[DOI]

SIAM J. Comput., 2004

The number of removable edges in a 4-connected graph.

[BibT_eX]

[DOI]

Jichang Wu

Jianji Su

J. Comb. Theory B, 2004

The complexity for partitioning graphs by monochromatic trees, cycles and paths.

[BibT_eX]

[DOI]

Int. J. Comput. Math., 2004

The Chromaticity of Certain Complete Multipartite Graphs.

[BibT_eX]

[DOI]

Graphs Comb., 2004

Removable Edges in Longest Cycles of 4-Connected Graphs.

[BibT_eX]

[DOI]

Jichang Wu

Graphs Comb., 2004

On the minimum real roots of the -polynomials and chromatic uniqueness of graphs.

[BibT_eX]

[DOI]

Discret. Math., 2004

The hamiltonian index of a graph and its branch-bonds.

[BibT_eX]

[DOI]

Discret. Math., 2004

Removable edges in a cycle of a 4-connected graph.

[BibT_eX]

[DOI]

Jichang Wu

Discret. Math., 2004

Integral complete r-partite graphs.

[BibT_eX]

[DOI]

Cornelis Hoede

Discret. Math., 2004

Isomorphisms of Pk-graphs for kge4.

[BibT_eX]

[DOI]

Biao Zhao

Discret. Math., 2004

Families of integral trees with diameters 4, 6, and 8.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2004

On properties of adjoint polynomials of graphs and their applications.

[BibT_eX]

[DOI]

Australas. J Comb., 2004

On a conjecture on k-walks of graphs.

[BibT_eX]

[DOI]

Australas. J Comb., 2004

Computing the Rupture Degrees of Graphs.

[BibT_eX]

[DOI]

Proceedings of the 7th International Symposium on Parallel Architectures, 2004

Linear Time Algorithms to the Minimum All-Ones Problem for UniCyclic and Bicyclic Graphs.

[BibT_eX]

Proceedings of the CTW04 Workshop on Graphs and Combinatorial Optimization, 2004

2003

Solutions for Two Conjectures on the Inverse Problem of the Wiener Index of Peptoids.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2003

The Inverse Problems for Some Topological Indices in Combinatorial Chemistry.

[BibT_eX]

[DOI]

Zimao Li

J. Comput. Biol., 2003

On a tree graph defined by a set of cycles.

[BibT_eX]

[DOI]

Victor Neumann-Lara

Eduardo Rivera-Campo

Discret. Math., 2003

2002

Computing the Scattering Number of Graphs.

[BibT_eX]

[DOI]

Xinglou Han

Int. J. Comput. Math., 2002

A Fan Type Condition For Heavy Cycles in Weighted Graphs.

[BibT_eX]

[DOI]

Graphs Comb., 2002

Isomorphisms and traversability of directed path graphs.

[BibT_eX]

[DOI]

Discuss. Math. Graph Theory, 2002

Degree sums and subpancyclicity in line graphs.

[BibT_eX]

[DOI]

Discret. Math., 2002

Some approaches to a conjecture on short cycles in digraphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2002

Integral trees with diameters 4, 6 and 8.

[BibT_eX]

[DOI]

Xiangjuan Yao

Australas. J Comb., 2002

2001

A Co-Marginalistic Contribution Value for Set Games.

[BibT_eX]

[DOI]

IGTR, 2001

Some New Families of Integral Trees with Diameters 4 and 6.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2001

Paths and Cycles in Colored Graphs.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2001

A σ3 type condition for heavy cycles in weighted graphs.

[BibT_eX]

[DOI]

Discuss. Math. Graph Theory, 2001

2000

Heavy paths and cycles in weighted graphs.

[BibT_eX]

[DOI]

Discret. Math., 2000

Some new classes of integral trees with diameters 4 and 6.

[BibT_eX]

[DOI]

Australas. J Comb., 2000

1999

Integral Trees With Diameter 6 or 8.

[BibT_eX]

[DOI]

Hortensia Galeana-Sánchez

Ruying Liu

Electron. Notes Discret. Math., 1999

1998

Semikernels and (k, l)-Kernels in Digraphs.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 1998

Edge-disjoint minimum-weight connected spanning k-edge subgraphs in a weighted graph: A connectedness theorem.

[BibT_eX]

[DOI]

Discret. Math., 1998

The connectivity of the SEE-graph and AEE-graph for the connected spanning k-edge subgraphs of a graph.

[BibT_eX]

[DOI]

Hortensia Galeana-Sánchez

Discret. Math., 1998

Kernels in a special class of digraphs.

[BibT_eX]

[DOI]

Discret. Math., 1998

On the Determination Problem for P3-Transformation of Graphs.

[BibT_eX]

Ars Comb., 1998

1997

Spanning trees with many or few colors in edge-colored graphs.

[BibT_eX]

[DOI]

Discuss. Math. Graph Theory, 1997

A lower bound for the connectivity of directed Euler tour transformation graphs.

[BibT_eX]

[DOI]

Discret. Math., 1997

Hexagonal Systems with Forcing Single Edges.

[BibT_eX]

[DOI]

Discret. Appl. Math., 1997

Isomorphisms of P4-graphs.

[BibT_eX]

[DOI]

Biao Zhao

Australas. J Comb., 1997

1996

Isomorphisms of P3-graphs.

[BibT_eX]

[DOI]

J. Graph Theory, 1996

A solution to Gutman's problem on the characteristic polynomial of a bipartite graph.

[BibT_eX]

[DOI]

Heping Zhang

Discret. Math., 1996

The connectivity of the leaf-exchange spanning tree graph of a graph.

[BibT_eX]

Ars Comb., 1996

On a conjecture of Merrifield and Simmons.

[BibT_eX]

[DOI]

Australas. J Comb., 1996

1995

Hexagonal systems with forcing edges.

[BibT_eX]

[DOI]

Discret. Math., 1995

A Unified Approach to the First Derivatives of Graph Polynomials.

[BibT_eX]

[DOI]

Ivan Gutman

Discret. Appl. Math., 1995

1994

n-Dimensional line graphs.

[BibT_eX]

[DOI]

Discret. Math., 1994

Clique polynomials and independent set polynomials of graphs.

[BibT_eX]

[DOI]

Cornelis Hoede

Discret. Math., 1994

Hamiltonicity of a Type of Interchange Graphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 1994

1993

Hexagonal Systems with Fixed Bonds.

[BibT_eX]

[DOI]

Heping Zhang

Discret. Appl. Math., 1993

On "The Matching Polynomial of a Polygraph".

[BibT_eX]

[DOI]

Discret. Appl. Math., 1993

1992

The connectivity of the basis graph of a branching greedoid.

[BibT_eX]

[DOI]

Haitze J. Broersma

J. Graph Theory, 1992

1991

On the numbers of spanning trees and Eulerian tours in generalized de Bruijn graphs.

[BibT_eX]

[DOI]