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

DOI10.1002/NET.3230130302zbMATH Open0528.90086OpenAlexW2091940105MaRDI QIDQ3309475FDOQ3309475

Authors: Robert J. Opsut, Fred Roberts 

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)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Incidence matrices and interval graphs
• A Characterization of Comparability Graphs and of Interval Graphs

Cited In (4)

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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3309475)