Full Text Available

Note: Clicking the button above will open the full text document at the original institutional repository in a new window.

Tree-independence number of $P_5$-free graphs with no large bicliques

Saved in:
Bibliographic Details
Published in:ArXiv cs.DM Recent Papers
Format: Online Article RSS Article
Published: 2026
Subjects:
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1864493180028715010
collection WordPress RSS
FRELIP Feed Integration
container_title ArXiv cs.DM Recent Papers
description
discipline_display Engineering & Technology
discipline_facet Engineering & Technology
format Online Article
RSS Article
genre Journal Article
id rss_article:49870
institution FRELIP
journal_source_facet ArXiv cs.DM Recent Papers
publishDate 2026
publishDateSort 2026
record_format rss_article
spellingShingle Tree-independence number of $P_5$-free graphs with no large bicliques
ArXiv cs.DM Recent Papers
Computer Science & IT
Engineering & Technology
sub_discipline_display Computer Science & IT
sub_discipline_facet Computer Science & IT
subject_display ArXiv cs.DM Recent Papers
Computer Science & IT
Engineering & Technology
ArXiv cs.DM Recent Papers
Computer Science & IT
Engineering & Technology
subject_facet ArXiv cs.DM Recent Papers
Computer Science & IT
Engineering & Technology
title Tree-independence number of $P_5$-free graphs with no large bicliques
title_auth Tree-independence number of $P_5$-free graphs with no large bicliques
title_full Tree-independence number of $P_5$-free graphs with no large bicliques
title_fullStr Tree-independence number of $P_5$-free graphs with no large bicliques
title_full_unstemmed Tree-independence number of $P_5$-free graphs with no large bicliques
title_short Tree-independence number of $P_5$-free graphs with no large bicliques
title_sort tree-independence number of $p_5$-free graphs with no large bicliques
topic ArXiv cs.DM Recent Papers
Computer Science & IT
Engineering & Technology
url https://arxiv.org/abs/2605.03965v1