Edge colourings of embedded graphs without 4-cycles or chordal-4-cycles
From MaRDI portal
Publication:3066941
DOI10.1080/00207160903033648zbMATH Open1214.05026OpenAlexW2084923272MaRDI QIDQ3066941FDOQ3066941
Authors: Bin Liu, Jianfeng Hou, Guizhen Liu, Jihui Wang 
Publication date: 20 January 2011
Published in: International Journal of Computer Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/00207160903033648
Recommendations
Cites Work
- Scheduling File Transfers
- Coloring edges of graphs embedded in a surface of characteristic zero.
- Planar graphs of maximum degree seven are Class I
- Every planar graph with maximum degree 7 is of class 1
- A sufficient condition for a planar graph to be class I
- Some sufficient conditions for a planar graph of maximum degree six to be Class 1
- Edge coloring of graphs with small average degrees
- Edge coloring of embedded graphs with large girth
- Edge colorings of graphs embeddable in a surface of low genus
- Coloring edges of embedded graphs
- Scheduling File Transfers for Trees and Odd Cycles
Cited In (6)
- Edge-partitions of graphs of nonnegative characteristic and their game coloring numbers
- Edge coloring of embedded graphs with large girth
- Edge colorings of embedded special graphs
- Edge colourings of embedded special graphs
- Title not available (Why is that?)
- Total colorings of embedded graphs with no 3-cycles adjacent to 4-cycles
This page was built for publication: Edge colourings of embedded graphs without 4-cycles or chordal-4-cycles
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3066941)
