Hypergraph incidence coloring
From MaRDI portal
Publication:2689485
DOI10.1016/j.disc.2022.113311OpenAlexW4320536311MaRDI QIDQ2689485
Publication date: 10 March 2023
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2202.02770
Cites Work
- On incidence coloring conjecture in Cartesian products of graphs
- Strong edge-coloring of \((3, \varDelta)\)-bipartite graphs
- The strong chromatic index of \((3,\Delta)\)-bipartite graphs
- On induced matchings
- Induced matchings in bipartite graphs
- A note on the strong chromatic index of bipartite graphs
- Invalid proofs on incidence coloring
- Incidence and strong edge colorings of graphs
- A bound on the strong chromatic index of a graph
- Oriented incidence colourings of digraphs
- The incidence coloring conjecture for graphs of maximum degree 3
- Incidence coloring of \(k\)-degenerated graphs
- Incidence coloring of mycielskians with fast algorithm
- Colouring graphs with sparse neighbourhoods: bounds and applications
- Transversals in linear uniform hypergraphs
- Incidence coloring -- cold cases
- Incidence choosability of graphs
- Incidence coloring of graphs with high maximum average degree
- Note on incidence chromatic number of subquartic graphs
- NP-completeness of 4-incidence colorability of semi-cubic graphs
- Interval incidence coloring of bipartite graphs
- Defective incidence coloring of graphs
- On the Desirability of Acyclic Database Schemes
- Degrees of acyclicity for hypergraphs and relational database schemes
- The α-Arboricity of Complete Uniform Hypergraphs
- Simple Linear-Time Algorithms to Test Chordality of Graphs, Test Acyclicity of Hypergraphs, and Selectively Reduce Acyclic Hypergraphs
- The strong chromatic index ofC4-free graphs
- A Stronger Bound for the Strong Chromatic Index
- The incidence game chromatic number
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Hypergraph incidence coloring
