Arrangements, channel assignments, and associated polynomials
DOI10.1006/aama.1999.0660zbMath0942.05063OpenAlexW2047371574MaRDI QIDQ1961908
Geoffrey P. Whittle, Dominic J. A. Welsh
Publication date: 31 July 2000
Published in: Advances in Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://ora.ox.ac.uk/objects/uuid:761348b8-d6d4-4769-93e8-71360427a7d7
intersection theoryconfigurationgraph colouringchannel assignmentarrangementrank functiongeometric latticeWhitney polynomialRedei functionsTutte-Grothendieck invariant
Applications of graph theory (05C90) Hypergraphs (05C65) Planar graphs; geometric and topological aspects of graph theory (05C10) Questions of classical algebraic geometry (51N35) Enumerative problems (combinatorial problems) in algebraic geometry (14N10) Coloring of graphs and hypergraphs (05C15)
Related Items (5)
Cites Work
- The Redei function of a relation
- Intersection theory for graphs
- A geometric theory of hypergraph colouring
- Characteristic polynomials of weighted lattices
- Characteristic and Ehrhart polynomials
- Chromatic invariants for finite graphs: Theme and polynomial variations
- Characteristic polynomials of subspace arrangements and finite fields
- Star chromatic number
- Intersection Theory for Embeddings of Matroids into Uniform Geometries
- Graph labeling and radio channel assignment
- THE CRITICAL PROBLEM FOR POLYMATROIDS
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Arrangements, channel assignments, and associated polynomials