Between clique-width and linear clique-width of bipartite graphs

DOI10.1016/j.disc.2020.111926zbMath1441.05112OpenAlexW3016270429MaRDI QIDQ2185929

Mamadou Moustapha Kanté, Vadim V. Lozin, Bogdan Alecu, Victor Zamaraev

Publication date: 8 June 2020

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

Full work available at URL: http://wrap.warwick.ac.uk/136165/1/WRAP-Between-clique-width-linear-clique-width-bipartite-graph-Lozin-2020.pdf

zbMATH Keywords

boundary classlinear clique-width\(L\)-critical graphbipartite cographbounded clique width

Mathematics Subject Classification ID

Enumeration in graph theory (05C30) Structural characterization of families of graphs (05C75) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Related Items (2)

A Framework for Minimal Hereditary Classes of Graphs of Unbounded Clique-Width ⋮ Tree Pivot-Minors and Linear Rank-Width

Cites Work

• Unnamed Item
• Unnamed Item
• Boundary properties of well-quasi-ordered sets of graphs
• Characterising the linear clique-width of a class of graphs by forbidden induced subgraphs
• On factorial properties of chordal bipartite graphs
• Minimal classes of graphs of unbounded clique-width
• Graphs of linear clique-width at most 3
• Upper domination: towards a dichotomy through boundary properties
• Labelled induced subgraphs and well-quasi-ordering
• Trivially perfect graphs
• The vertex separation and search number of a graph
• Bi-complement reducible graphs
• Linear clique-width of bi-complement reducible graphs
• Chordal bipartite graphs of bounded tree- and clique-width
• Quasi-threshold graphs
• Linear rank-width and linear clique-width of trees
• Infinitely many minimal classes of graphs of unbounded clique-width
• Boundary properties of the satisfiability problems
• On the relationship between NLC-width and linear NLC-width
• The relative clique-width of a graph
• Linear Time Algorithm for Computing a Small Biclique in Graphs without Long Induced Paths
• Linear Clique‐Width for Hereditary Classes of Cographs
• THE CLIQUE-WIDTH OF BIPARTITE GRAPHS IN MONOGENIC CLASSES
• Clique-Width is NP-Complete
• An attractive class of bipartite graphs
• Boundary Properties of Factorial Classes of Graphs
• ON THE CLIQUE-WIDTH OF SOME PERFECT GRAPH CLASSES
• Bounding the clique-width of \(H\)-free split graphs

This page was built for publication: Between clique-width and linear clique-width of bipartite graphs