| Publication | Date of Publication | Type |
|---|
A constructive characterization of 4-connected 4-regular graphs
Discrete Mathematics | 2026-03-12 | Paper |
A constructive characterization of 5-connected graphs
The Australasian Journal of Combinatorics | 2026-02-12 | Paper |
Spanning path-cycle systems with given end-vertices in regular graphs
Graphs and Combinatorics | 2026-01-29 | Paper |
Forbidden trees with diameter six for 3-connected graphs.
Ars Combinatoria | 2025-11-25 | Paper |
Forbidden triples for \(2\)-connected graphs with minimum degree three which contain \(K_4\) and \(K_{2,2}\)
Theory and Applications of Graphs | 2025-11-14 | Paper |
Graph grabbing game on graphs with forbidden subgraphs
Discussiones Mathematicae. Graph Theory | 2025-05-12 | Paper |
Forbidden trees generating a finite set of 3-connected graphs with girth at least five
Scientiae Mathematicae Japonicae | 2025-03-05 | Paper |
Existence of 4-factors in star-free graphs with edge-connectivity conditions
AKCE International Journal of Graphs and Combinatorics | 2024-12-10 | Paper |
Forbidden caterpillars for 3-connected graphs with girth at least five
The Australasian Journal of Combinatorics | 2024-11-28 | Paper |
On strict-double-bound graphs and Cartesian products of paths and cycles
Discrete Mathematics, Algorithms and Applications | 2024-11-13 | Paper |
On 2-factors with a specified number of components in line graphs
Acta Mathematica Universitatis Comenianae. New Series | 2024-10-18 | Paper |
Edges incident with a vertex of degree greater than four and the number of contractible edges in a 4-connected graph
Discrete Applied Mathematics | 2024-06-21 | Paper |
| scientific article; zbMATH DE number 7771746 (Why is no real title available?) | 2023-11-29 | Paper |
Properly 3-contractible edges in a minimally 3-connected graph
Discrete Mathematics | 2023-03-10 | Paper |
Contractible edges and longest cycles in 3-connected graphs
Graphs and Combinatorics | 2023-03-09 | Paper |
Minimum number of edges guaranteeing the existence of a \(K_{1, t}\)-factor in a graph
Graphs and Combinatorics | 2023-03-09 | Paper |
| Regular graph and some vertex-deleted subgraph | 2022-10-22 | Paper |
Factors of bi-regular bipartite graphs
Discrete Applied Mathematics | 2022-10-13 | Paper |
| scientific article; zbMATH DE number 7587748 (Why is no real title available?) | 2022-09-19 | Paper |
Forbidden triples generating a finite set of graphs with minimum degree three
Discrete Applied Mathematics | 2022-08-24 | Paper |
| Forbidden triples involving the complete bipartite graph with partite sets having cardinalities two and three. | 2022-04-22 | Paper |
Contractible edges and contractible triangles in a 3-connected graph
Graphs and Combinatorics | 2021-11-25 | Paper |
Tree in forbidden triples generating a finite set of graphs with high connectivity
AKCE International Journal of Graphs and Combinatorics | 2021-10-05 | Paper |
Existence of a spanning tree having small diameter
Discrete Mathematics | 2021-09-06 | Paper |
Existence of all generalized fractional \((g, f)\)-factors of graphs
Discrete Applied Mathematics | 2020-06-29 | Paper |
Path-factors involving paths of order seven and nine
Theory and Applications of Graphs | 2019-07-22 | Paper |
Structure of edges in a 4-connected graph not contained in triangles and the number of contractible edges
AKCE International Journal of Graphs and Combinatorics | 2019-01-25 | Paper |
Lower bound on the number of contractible edges in a 4-connected graph with edges not contained in triangles
Graphs and Combinatorics | 2019-01-11 | Paper |
Sufficient conditions for the existence of a path-factor which are related to odd components
Journal of Graph Theory | 2019-01-03 | Paper |
| Edges incident with a vertex of degree greater than four and a lower bound on the number of contractible edges in a 4-connected graph | 2018-10-11 | Paper |
Sufficient conditions for the existence of pseudo 2-factors without isolated vertices and small odd cycles
Discrete Mathematics | 2018-06-07 | Paper |
The existence of a path-factor without small odd paths
The Electronic Journal of Combinatorics | 2018-05-25 | Paper |
The graph grabbing game on \(K_{m, n}\)-trees
Discrete Mathematics | 2018-04-19 | Paper |
| On star-packings having a large matching | 2018-04-10 | Paper |
Perfect matchings avoiding several independent edges in a star-free graph
Journal of Graph Theory | 2016-06-10 | Paper |
\((1,f)\)-factors of graphs with odd property
Graphs and Combinatorics | 2016-03-02 | Paper |
Forbidden triples generating a finite set of 3-connected graphs
The Electronic Journal of Combinatorics | 2015-08-27 | Paper |
Perfect matchings avoiding prescribed edges in a star-free graph
Discrete Mathematics | 2015-08-05 | Paper |
Spanning trees with vertices having large degrees
Journal of Graph Theory | 2015-07-23 | Paper |
4-factors in graphs which do not contain a small star
AKCE International Journal of Graphs and Combinatorics | 2015-02-16 | Paper |
\(r\)-regular \(r\)-connected graphs with large girth
Advances and Applications in Discrete Mathematics | 2014-10-29 | Paper |
Forbidden triples containing a complete graph and a complete bipartite graph of small order
Graphs and Combinatorics | 2014-09-19 | Paper |
A necessary and sufficient condition for the existence of a spanning tree with specified vertices having large degrees
Combinatorica | 2014-08-14 | Paper |
The average degree of minimally contraction-critically 5-connected graphs
Journal of Graph Theory | 2014-05-22 | Paper |
Star-cycle factors of graphs
Discussiones Mathematicae Graph Theory | 2014-04-02 | Paper |
Existence of 4-factors in star-free graphs with high connectivity
The Australasian Journal of Combinatorics | 2014-01-03 | Paper |
Existence of 3-factors in 2-connected star-free graphs
Far East Journal of Applied Mathematics | 2013-11-19 | Paper |
Upper bounds on the paired domination subdivision number of a graph
Graphs and Combinatorics | 2013-07-19 | Paper |
Forbidden pairs for \(k\)-connected Hamiltonian graphs
Discrete Mathematics | 2012-03-16 | Paper |
The existence of a 2-factor in \(K_{1,n}\)-free graphs with large connectivity and large edge-connectivity
Journal of Graph Theory | 2011-10-12 | Paper |
Toughness of \(K_{a,t}\)-minor-free graphs
The Electronic Journal of Combinatorics | 2011-07-29 | Paper |
Toughness of \(K_{a,t}\)-minor-free graphs
The Electronic Journal of Combinatorics | 2011-07-29 | Paper |
| scientific article; zbMATH DE number 5717198 (Why is no real title available?) | 2010-06-07 | Paper |
4-factors in 2-connected star-free graphs
Discrete Mathematics | 2009-12-15 | Paper |
Arbitrary decompositions into open and closed trails
Discrete Mathematics | 2009-06-17 | Paper |
5-shredders in 5-connected graphs
Discrete Mathematics | 2009-06-17 | Paper |
On \(2\)-factors in \(r\)-connected \(\{K_{1,k},P_4\}\)-free graphs
Tokyo Journal of Mathematics | 2009-04-21 | Paper |
<i>k</i>-shredders in<i>k</i>-connected graphs
Journal of Graph Theory | 2009-02-20 | Paper |
\(K_{1,3}\)-factors in graphs
Discrete Mathematics | 2009-01-28 | Paper |
Edges not contained in triangles and the number of contractible edges in a 4-connected graph
Discrete Mathematics | 2009-01-28 | Paper |
On the number of 4-contractible edges in 4-connected graphs
Journal of Combinatorial Theory. Series B | 2009-01-21 | Paper |
Nonseparating Induced Cycles Consisting of Contractible Edges in <i>k</i>-Connected Graphs
SIAM Journal on Discrete Mathematics | 2008-12-05 | Paper |
Edges not contained in triangles and the distribution of contractible edges in a 4-connected graph
Discrete Mathematics | 2008-07-11 | Paper |
| Proof techniques for factor theorems | 2008-07-01 | Paper |
On a spanning tree with specified leaves
Graphs and Combinatorics | 2008-04-16 | Paper |
| Orientation of 2-edge-connected graphs with diameter 3 | 2008-04-14 | Paper |
\(k\)-factors containing and avoiding specified sets of edges
AKCE International Journal of Graphs and Combinatorics | 2008-02-05 | Paper |
Contractible edges in a 4-connected graph with vertices of degree greater than four
Graphs and Combinatorics | 2007-07-19 | Paper |
Independence number and vertex-disjoint cycles
Discrete Mathematics | 2007-04-26 | Paper |
Vertex-disjoint cycles containing specified vertices in a graph
AKCE International Journal of Graphs and Combinatorics | 2006-10-12 | Paper |
Existence of two disjoint long cycles in graphs
Discrete Mathematics | 2006-01-10 | Paper |
| scientific article; zbMATH DE number 2230280 (Why is no real title available?) | 2005-11-18 | Paper |
| scientific article; zbMATH DE number 2188395 (Why is no real title available?) | 2005-07-26 | Paper |
| scientific article; zbMATH DE number 2188351 (Why is no real title available?) | 2005-07-26 | Paper |
| scientific article; zbMATH DE number 2186977 (Why is no real title available?) | 2005-07-13 | Paper |
Covering vertices of a graph by \(k\) disjoint cycles
Discrete Mathematics | 2003-09-04 | Paper |
Two‐factors each component of which contains a specified vertex
Journal of Graph Theory | 2003-07-31 | Paper |
Graphs \(G\) for which both \(G\) and \(\overline {G}\) are contraction critically \(k\)-connected
Graphs and Combinatorics | 2003-03-27 | Paper |
Maximum number of edges in a critically k-connected graph
Discrete Mathematics | 2003-03-16 | Paper |
Fan‐type theorem for path‐connectivity
Journal of Graph Theory | 2002-07-01 | Paper |
Path factors in claw-free graphs
Discrete Mathematics | 2002-03-13 | Paper |
Radius of \((2k-1)\)-connected graphs
Ars Combinatoria | 2001-12-17 | Paper |
Graph labellings in Boolean lattices
Ars Combinatoria | 2001-12-17 | Paper |
Vertex-disjoint cycles containing specified edges
Graphs and Combinatorics | 2001-01-02 | Paper |
Contractible cycles in graphs with girth at least 5
Journal of Combinatorial Theory. Series B | 2000-06-25 | Paper |
Vertex-disjoint claws in graphs
Discrete Mathematics | 2000-04-10 | Paper |
Graph labelings in elementary abelian 2-groups
Tokyo Journal of Mathematics | 1998-03-18 | Paper |
| scientific article; zbMATH DE number 1033810 (Why is no real title available?) | 1997-12-08 | Paper |
The minimum number of edges in a vertex diameter-2-critical graph
Discrete Mathematics | 1997-11-09 | Paper |
Contractible cycles in graphs with large minimum degree
Discrete Mathematics | 1997-08-10 | Paper |
Sufficient conditions for graphs to have \((g,f)\)-factors
Discrete Mathematics | 1996-12-09 | Paper |
Vertex-disjoint cycles of the same length
Journal of Combinatorial Theory. Series B | 1996-10-14 | Paper |
| Essential independent sets and Hamiltonian cycles | 1996-02-25 | Paper |
Non-contractible edges in a 3-connected graph
Combinatorica | 1995-10-17 | Paper |
The maximal number of induced \(r\)-partite subgraphs
Graphs and Combinatorics | 1995-05-11 | Paper |
| scientific article; zbMATH DE number 482046 (Why is no real title available?) | 1995-01-26 | Paper |
| scientific article; zbMATH DE number 568792 (Why is no real title available?) | 1994-05-17 | Paper |
Spanning trees in a cactus
Discrete Mathematics | 1993-05-16 | Paper |
| scientific article; zbMATH DE number 54781 (Why is no real title available?) | 1992-09-26 | Paper |
A mixed version of Menger's theorem
Combinatorica | 1992-06-27 | Paper |
Contractible edges in non-separating cycles
Combinatorica | 1992-06-27 | Paper |
| scientific article; zbMATH DE number 12944 (Why is no real title available?) | 1992-06-25 | Paper |
Regular factors in <i>K</i><sub>1,<i>n</i></sub> free graphs
Journal of Graph Theory | 1992-06-25 | Paper |
Contractible edges in \(n\)-connected graphs with minimum degree greater than or equal to \([5n/4]\)
Graphs and Combinatorics | 1992-06-25 | Paper |
Cycles and paths through specified vertices in k-connected graphs
Journal of Combinatorial Theory. Series B | 1991-01-01 | Paper |
| scientific article; zbMATH DE number 4191727 (Why is no real title available?) | 1989-01-01 | Paper |
The longest cycles in a graph G with minimum degree at least \(| G| /k\)
Journal of Combinatorial Theory. Series B | 1989-01-01 | Paper |
Factors and induced subgraphs
Discrete Mathematics | 1988-01-01 | Paper |
Preface
Discrete Mathematics | 1988-01-01 | Paper |
Cycles in k-connected graphs whose deletion results in a (k-2)-connected graph
Journal of Combinatorial Theory. Series B | 1987-01-01 | Paper |
On randomly n-cyclic digraphs
Graphs and Combinatorics | 1987-01-01 | Paper |
Graphs G for which G and \(\bar G\) are both semidecomposable
Discrete Mathematics | 1987-01-01 | Paper |
| scientific article; zbMATH DE number 4055663 (Why is no real title available?) | 1986-01-01 | Paper |
A decomposition of complete bipartite graphs into edge-disjoint subgraphs with star components
Discrete Mathematics | 1986-01-01 | Paper |
Characterization of the Cartesian product of complete graphs by convex subgraphs
Discrete Mathematics | 1986-01-01 | Paper |
On component factors
Graphs and Combinatorics | 1986-01-01 | Paper |
Association schemes of quadratic forms
Journal of Combinatorial Theory. Series A | 1985-01-01 | Paper |
Automorphism groups of \(\Sigma _{n+1}\)-invariant trilinear forms
Hokkaido Mathematical Journal | 1985-01-01 | Paper |
Automorphism groups of multilinear mappings
Journal of the Mathematical Society of Japan | 1985-01-01 | Paper |
Even edge colorings of a graph
Journal of Combinatorial Theory. Series B | 1985-01-01 | Paper |
Standard subgroups of type \(2\Omega+(8,2)\)
Hokkaido Mathematical Journal | 1982-01-01 | Paper |
Nonnegative Matrices <i>A</i> Such that $Ax = b$ has Nonnegative Best Approximate Solution
SIAM Journal on Algebraic Discrete Methods | 1982-01-01 | Paper |
Characterization of H(n,q) by the parameters
Journal of Combinatorial Theory. Series A | 1981-01-01 | Paper |
Standard components of type M<sub>24</sub>
Communications in Algebra | 1981-01-01 | Paper |
| scientific article; zbMATH DE number 3606655 (Why is no real title available?) | 1977-01-01 | Paper |
Forbidden subgraphs generating a finite set of graphs with minimum degree three and large girth
(available as arXiv preprint) | N/A | Paper |
