Multi-word-representability of graphs

DOI10.1016/J.DAM.2025.05.021MaRDI QIDQ6965804zbMATH OpenFDO

Authors Benny George Kenkireth, G. Sajith, Sreyas Sasidharan

Publication date 30 June 2025

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

Full work available at URL https://doi.org/10.1016/J.DAM.2025.05.021

zbMATH Keywords

2-multi-word-representable graphchordal graphmulti-word-representabilityperfect graphword-representable graph

Mathematics Subject Classification ID

Perfect graphs (05C17) Graph representations (geometric and intersection representations, etc.) (05C62)

Cites work

• A comprehensive introduction to the theory of word-representable graphs
• Brief announcement: Distributed minimum vertex coloring and maximum independent set in chordal graphs
• Classes of perfect graphs
• Computing the boxicity of a graph by covering its complement by cointerval graphs
• Decomposition of Finite Graphs Into Forests
• scientific article; zbMATH DE number 554762 (Why is no real title available?)
• Human-verifiable proofs in the theory of word-representable graphs
• New results on word-representable graphs
• On representable graphs
• On the Shannon capacity of a graph
• On word-representable and multi-word-representable graphs
• The ellipsoid method and its consequences in combinatorial optimization
• Threshold Dimension of Graphs
• Well-partitioned chordal graphs
• Word problem of the Perkins semigroup via directed acyclic graphs.
• Words and graphs

This page was built for publication: Multi-word-representability of graphs

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