Strong Edge Coloring of Outerplane Graphs with Independent Crossings

DOI10.1007/S10255-024-1026-6MaRDI QIDQ6489818

Kejie Li, Xin Zhang

Publication date: 22 April 2024

Published in: Acta Mathematicae Applicatae Sinica. English Series (Search for Journal in Brave)

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Outer 1-planar graphs
• A stronger bound for the strong chromatic index (extended abstract)
• Edge covering pseudo-outerplanar graphs with forests
• Drawing complete multipartite graphs on the plane with restrictions on crossings
• A linear-time algorithm for testing outer-1-planarity
• L-visibility drawings of IC-planar graphs
• A bound on the strong chromatic index of a graph
• Total coloring of outer-1-planar graphs with near-independent crossings
• The structure of plane graphs with independent crossings and its applications to coloring problems
• Acyclic edge coloring of IC-planar graphs
• Colouring graphs with sparse neighbourhoods: bounds and applications
• Adjacent vertex distinguishing edge coloring of IC-planar graphs
• The maximum size of an edge 2-neighborhood in \(P_5\)-free graphs
• Equitable partition of plane graphs with independent crossings into induced forests
• Strong chromatic index of \(K_4\)-minor free graphs
• Strong edge-colouring and induced matchings
• Strong edge-colorings of planar graphs with small girth
• IC-Planar Graphs Are 6-Choosable

This page was built for publication: Strong Edge Coloring of Outerplane Graphs with Independent Crossings