\textsc{Tessellability} and \textsc{tessellability completion} of graphs with few P₄

DOI10.21711/231766362020/RMC465MaRDI QIDQ6492322zbMATH OpenFDO

Authors Alexandre S. de Abreu, Franklin de L. Marquezino, Daniel F. D. Posner

Publication date 25 April 2024

Published in Matemática Contemporânea (Search for Journal in Brave)

Full work available at URL https://doi.org/10.21711/231766362020/RMC465

zbMATH Keywords

graph tessellationsgraphs with few \(P_4\)'squasi-threshold graphs

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Applications of graph theory (05C90) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Recommendations

• The graph tessellation cover number: extremal bounds, efficient algorithms and hardness
• The graph tessellation cover number: chromatic bounds, efficient algorithms and hardness
• A computational complexity comparative study of graph tessellation problems
• Total tessellation cover: bounds, hardness, and applications
• Bounds and complexity for the tessellation problem

This page was built for publication: \textsc{Tessellability} and \textsc{tessellability completion} of graphs with few \(P_4\)

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6492322)