New tools to study 1-11-representation of graphs

DOI10.1007/s00373-024-02825-1zbMATH Open1548.05245MaRDI QIDQ6616436

Artem V. Pyatkin, Mikhail Futorny, Sergey Kitaev

Publication date: 9 October 2024

Published in: Graphs and Combinatorics (Search for Journal in Brave)

zbMATH Keywords

split graphcomparability graphMycielski graphword-representable graphChvátal graph1-11-representable graph

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Graph representations (geometric and intersection representations, etc.) (05C62)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Representing graphs via pattern avoiding words
• Words and graphs
• Semi-transitive orientations and word-representable graphs
• The splittance of a graph
• Circle graph obstructions
• Efficient graph representations
• Word-representability of split graphs
• Word-representability of split graphs generated by morphisms
• Representing split graphs by words
• On \(k\)-\(11\)-representable graphs
• Representation of a finite graph by a set of intervals on the real line
• Recognition of Circle Graphs
• On representable graphs
• The smallest triangle-free 4-chromatic 4-regular graph
• Sur le coloriage des graphs
• On semi-transitive orientability of split graphs
• Human-verifiable proofs in the theory of word-representable graphs

This page was built for publication: New tools to study 1-11-representation of graphs