I-Colorings,I-Phasings, andI-Intersection assignments for graphs, and their applications

DOI10.1002/net.3230130302zbMath0528.90086OpenAlexW2091940105MaRDI QIDQ3309475

Fred S. Roberts, Robert J. Opsut

Publication date: 1983

Published in: Networks (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/net.3230130302

zbMATH Keywords

complementary graphset coloringset assignments on graphsset intersection assignmentset phasing

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Extremal problems in graph theory (05C35) Integer programming (90C10)

Related Items (4)

Generating the family of all traffic signal light cycles coordinated with pedestrian crosswalks ⋮ Algorithmic aspects of intersection graphs and representation hypergraphs ⋮ Optimal multiple interval assignments in frequency assignment and traffic phasing ⋮ Applications of edge coverings by cliques

Cites Work

• Incidence matrices and interval graphs
• A Characterization of Comparability Graphs and of Interval Graphs
• Unnamed Item
• Unnamed Item

This page was built for publication: I-Colorings,I-Phasings, andI-Intersection assignments for graphs, and their applications