Bipartite graphs without a skew star

DOI10.1016/S0012-365X(01)00471-XzbMath1010.05067OpenAlexW1998244133MaRDI QIDQ1849995

Vadim V. Lozin

Publication date: 2 December 2002

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0012-365x(01)00471-x

zbMATH Keywords

structural characterizationbipartite graphsclique-width

Mathematics Subject Classification ID

Structural characterization of families of graphs (05C75) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (18)

Triangle-free graphs with no six-vertex induced path ⋮ Unnamed Item ⋮ Colouring diamond-free graphs ⋮ Graph parameters, implicit representations and factorial properties ⋮ Graph classes with linear Ramsey numbers ⋮ Independent domination in finitely defined classes of graphs ⋮ On factorial properties of chordal bipartite graphs ⋮ THE CLIQUE-WIDTH OF BIPARTITE GRAPHS IN MONOGENIC CLASSES ⋮ Recent developments on graphs of bounded clique-width ⋮ Augmenting chains in graphs without a skew star. ⋮ Graph parameters, implicit representations and factorial properties ⋮ Colouring Vertices of Triangle-Free Graphs ⋮ Forbidden induced bipartite graphs ⋮ Colouring vertices of triangle-free graphs without forests ⋮ Chordal bipartite graphs of bounded tree- and clique-width ⋮ On efficient domination for some classes of \(H\)-free bipartite graphs ⋮ Squares of Intersection Graphs and Induced Matchings ⋮ Tree Pivot-Minors and Linear Rank-Width

This page was built for publication: Bipartite graphs without a skew star