Template-driven rainbow coloring of proper interval graphs
From MaRDI portal
Publication:5896886
DOI10.1007/978-3-030-67899-9_36OpenAlexW3129161982MaRDI QIDQ5896886FDOQ5896886
Authors: L. Sunil Chandran, Sajal K. Das, Sajith Padinhatteeri, Raji R. Pillai, Pavol Hell 
Publication date: 24 March 2022
Published in: Algorithms and Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-030-67899-9_36
Cites Work
- Algorithmic graph theory and perfect graphs
- Optimal greedy algorithms for indifference graphs
- Large rainbow matchings in edge-coloured graphs
- Linear-Time Representation Algorithms for Proper Circular-Arc Graphs and Proper Interval Graphs
- Simple linear time recognition of unit interval graphs
- Rainbow matching in edge-colored graphs
- A survey on the distance-colouring of graphs
- Conflict-free star-access in parallel memory systems
- A linear time recognition algorithm for proper interval graphs
- Induced colorful trees and paths in large chromatic graphs
- Mappings for conflict-free access of paths in bidimensional arrays, circular lists, and complete trees
- Some uses of hypergraphs in timetabling
- Optimal mappings of \(q\)-ary and binomial trees into parallel memory modules for fast and conflict-free access to path and subtree templates
- Induced subgraphs of graphs with large chromatic number. IX: Rainbow paths
- Long rainbow paths and rainbow cycles in edge colored graphs. A survey
- Long rainbow cycles and Hamiltonian cycles using many colors in properly edge-colored complete graphs
- Algorithms and bounds for very strong rainbow coloring
This page was built for publication: Template-driven rainbow coloring of proper interval graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5896886)
