Hypergraph incidence coloring

DOI10.1016/J.DISC.2022.113311MaRDI QIDQ2689485zbMATH OpenOpenAlexFDO

Authors Weichan Liu, Guiying Yan

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

zbMATH Keywords

\(\alpha\)-acyclic hypergraphincidence coloringlinear hypergraphstrong edge coloring

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Hypergraphs (05C65)

Recommendations

• Incidence coloring on hypercubes
• On the maximum average degree and the incidence chromatic number
• Incidence and strong edge colorings of graphs
• Incidence coloring -- cold cases
• On the chromaticity of quasi linear hypergraphs

Cites work

• 2-distance coloring of sparse graphs
• A bound on the strong chromatic index of a graph
• A note on the strong chromatic index of bipartite graphs
• A stronger bound for the strong chromatic index
• Colouring graphs with sparse neighbourhoods: bounds and applications
• Defective incidence coloring of graphs
• Degrees of acyclicity for hypergraphs and relational database schemes
• Fractional incidence coloring and star arboricity of graphs.
• scientific article; zbMATH DE number 5279355 (Why is no real title available?)
• scientific article; zbMATH DE number 4187830 (Why is no real title available?)
• Incidence and strong edge colorings of graphs
• Incidence choosability of graphs
• Incidence coloring -- cold cases
• Incidence coloring of k-degenerated graphs
• Incidence coloring of graphs with high maximum average degree
• Incidence coloring of mycielskians with fast algorithm
• Induced matchings in bipartite graphs
• Interval incidence coloring of bipartite graphs
• Invalid proofs on incidence coloring
• Note on incidence chromatic number of subquartic graphs
• NP-completeness of 4-incidence colorability of semi-cubic graphs
• On incidence coloring conjecture in Cartesian products of graphs
• On induced matchings
• On the Desirability of Acyclic Database Schemes
• Oriented incidence colourings of digraphs
• Simple Linear-Time Algorithms to Test Chordality of Graphs, Test Acyclicity of Hypergraphs, and Selectively Reduce Acyclic Hypergraphs
• Strong edge-coloring of \((3, \varDelta)\)-bipartite graphs
• The -arboricity of complete uniform hypergraphs
• The incidence coloring conjecture for graphs of maximum degree 3
• The incidence game chromatic number
• The strong chromatic index of \((3,\Delta)\)-bipartite graphs
• The strong chromatic index ofC4-free graphs
• Transversals in linear uniform hypergraphs

Cited in

(4)

• Incidence coloring on hypercubes
• Simultaneous coloring of vertices and incidences of hypercubes
• Hypergraph incidence coloring
• Topological analysis of super-dyadic graphs

This page was built for publication: Hypergraph incidence coloring

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