New tools to study 1-11-representation of graphs
From MaRDI portal
Publication:6616436
Recommendations
Cites work
- scientific article; zbMATH DE number 3859178 (Why is no real title available?)
- scientific article; zbMATH DE number 3588700 (Why is no real title available?)
- scientific article; zbMATH DE number 3361902 (Why is no real title available?)
- Circle graph obstructions
- Efficient graph representations
- Human-verifiable proofs in the theory of word-representable graphs
- On k-11-representable graphs
- On representable graphs
- On semi-transitive orientability of split graphs
- Recognition of Circle Graphs
- Representation of a finite graph by a set of intervals on the real line
- Representing graphs via pattern avoiding words
- Representing split graphs by words
- Semi-transitive orientations and word-representable graphs
- Sur le coloriage des graphs
- The smallest triangle-free 4-chromatic 4-regular graph
- The splittance of a graph
- Word-representability of split graphs
- Word-representability of split graphs generated by morphisms
- Words and graphs
Cited in
(2)
This page was built for publication: New tools to study 1-11-representation of graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6616436)