Discrete Applied Mathematics - Combinatorial Optimization
Computing a maximum cardinality matching in a bipartite graph in time On1.5m/logn
Information Processing Letters
Irredundancy in circular arc graphs
Discrete Applied Mathematics
Stability number of bull- and chair-free graphs
Discrete Applied Mathematics
Discrete Mathematics
Handle-rewriting hypergraph grammars
Journal of Computer and System Sciences
On the size of hereditary classes of graphs
Journal of Combinatorial Theory Series B
Nonredundant 1's in $\Gamma$-Free Matrices
SIAM Journal on Discrete Mathematics
Polynomially solvable cases for the maximum stable set problem
Discrete Applied Mathematics - Special volume: Aridam VI and VII, Rutcor, New Brunswick, NJ, USA (1991 and 1992)
Regular Article: Bi-complement Reducible Graphs
Advances in Applied Mathematics
Proceedings of an international symposium on Graphs and combinatorics
Stable sets in certain P6-free graphs
Discrete Applied Mathematics
Upper bounds to the clique width of graphs
Discrete Applied Mathematics
New results on induced matchings
Discrete Applied Mathematics
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
The Computation of the Jump Number of Convex Graphs
ORDAL '94 Proceedings of the International Workshop on Orders, Algorithms, and Applications
The Jump Number Problem for Biconvex Graphs and Rectangle Covers of Rectangular Regions
FCT '89 Proceedings of the International Conference on Fundamentals of Computation Theory
On the Clique-Width of Graphs in Hereditary Classes
ISAAC '02 Proceedings of the 13th International Symposium on Algorithms and Computation
Independent domination in finitely defined classes of graphs
Theoretical Computer Science
Augmenting chains in graphs without a skew star
Journal of Combinatorial Theory Series B
Recent developments on graphs of bounded clique-width
Discrete Applied Mathematics
Colouring vertices of triangle-free graphs
WG'10 Proceedings of the 36th international conference on Graph-theoretic concepts in computer science
Clique-width for four-vertex forbidden subgraphs
FCT'05 Proceedings of the 15th international conference on Fundamentals of Computation Theory
| Hi-index | 0.05 |
A skew star is a tree with exactly three vertices of degree one being at distance 1, 2, 3 from the only vertex of degree three. In the present paper, we propose a structural characterization for the class of bipartite graphs containing no skew star as an induced subgraph and discuss some applications of the obtained result.