Computing shortest 12-representants of labeled graphs

MaRDI QIDQ6644892zbMATH OpenFDO

Authors Asahi Takaoka

Publication date 28 November 2024

Published in The Australasian Journal of Combinatorics (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Mathematics Subject Classification ID

Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Recommendations

• Minimum length word-representants of word-representable graphs
• Representing graphs via pattern avoiding words
• Forbidden pattern characterizations of 12-representable graphs defined by pattern-avoiding words
• Solving computational problems in the theory of word-representable graphs

Cites work

• A comprehensive introduction to the theory of word-representable graphs
• A recognition algorithm for simple-triangle graphs
• A translation of Gallai's paper: `Transitiv orientierbare Graphen'
• A vertex ordering characterization of simple-triangle graphs
• Existence of u-representation of graphs
• scientific article; zbMATH DE number 4063148 (Why is no real title available?)
• On representable graphs
• On the 12-representability of induced subgraphs of a grid graph
• Representing graphs via pattern avoiding words
• Semi-transitive orientations and word-representable graphs
• Transitiv orientierbare Graphen
• Transitive Orientation of Graphs and Identification of Permutation Graphs
• Word problem of the Perkins semigroup via directed acyclic graphs.
• Words and graphs

This page was built for publication: Computing shortest 12-representants of labeled graphs

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