Complete edge-colored permutation graphs
From MaRDI portal
Publication:2672966
DOI10.1016/j.aam.2022.102377zbMath1491.05080arXiv2004.07118OpenAlexW3017006906MaRDI QIDQ2672966
Max Bannach, Nicolas Wieseke, Peter F. Stadler, Tom Hartmann, Marc Hellmuth, Martin Middendorf
Publication date: 13 June 2022
Published in: Advances in Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2004.07118
Applications of graph theory (05C90) Partitions of sets (05A18) Combinatorial identities, bijective combinatorics (05A19) Permutations, words, matrices (05A05) Coloring of graphs and hypergraphs (05C15) Graph algorithms (graph-theoretic aspects) (05C85) Fractional graph theory, fuzzy graph theory (05C72)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Pattern matching for permutations
- Edge search number of cographs
- A survey of the algorithmic aspects of modular decomposition
- Rainbow generalizations of Ramsey theory: A survey
- Characterization and complexity of uniformly nonprimitive labeled 2-structures
- On tree representations of relations and graphs: symbolic ultrametrics and cograph edge decompositions
- The number of Gallai \(k\)-colorings of complete graphs
- Partial (set) 2-structures. II: State spaces of concurrent systems
- Theory of 2-structures. I: Clans, basic subclasses, and morphisms
- Theory of 2-structures. II: Representation through labeled tree families
- Finding a maximum independent set in a permutation graph
- Colored graphs without colorful cycles
- Gallai colorings of non-complete graphs
- Monochromatic and heterochromatic subgraphs in edge-colored graphs - A survey
- Complement reducible graphs
- Comparability graphs and intersection graphs
- Perfect couples of graphs
- Recovering symbolically dated, rooted trees from symbolic ultrametrics
- Modular decomposition and transitive orientation
- Position and content paradigms in genome rearrangements: the wild and crazy world of permutations in genomics
- Achromatic number is NP-complete for cographs and interval graphs
- Algorithmic graph theory and perfect graphs
- Orthology relations, symbolic ultrametrics, and cographs
- Distribution of colors in Gallai colorings
- The mathematics of xenology: di-cographs, symbolic ultrametrics, 2-structures and tree-representable systems of binary relations
- Counting Gallai 3-colorings of complete graphs
- Connected permutation graphs
- On a property of the class of n-colorable graphs
- Ramsey-type results for Gallai colorings
- Large Monochromatic Components in Edge Colorings of Graphs: A Survey
- Fast Algorithms for Finding Nearest Common Ancestors
- Computing Common Intervals of K Permutations, with Applications to Modular Decomposition of Graphs
- Shuffling Cards and Stopping Times
- On Finding Lowest Common Ancestors in Trees
- Graph Classes: A Survey
- An O(n2) Divide-and-Conquer Algorithm for the Prime Tree Decomposition of Two-Structures and Modular Decomposition of Graphs
- Polynomial Algorithms for Hamiltonian Cycle in Cocomparability Graphs
- Lambda composition
- Edge colorings of complete graphs without tricolored triangles
- The Typical Structure of Gallai Colorings and Their Extremal Graphs
- Transitiv orientierbare Graphen
- Transitive Orientation of Graphs and Identification of Permutation Graphs
- Partial orders of dimension 2
- Fully dynamic algorithm for recognition and modular decomposition of permutation graphs
