The method of coloring in graphs and its application
From MaRDI portal
Publication:2429917
DOI10.1007/s11424-010-0211-2zbMath1216.05034MaRDI QIDQ2429917
Publication date: 5 April 2011
Published in: Journal of Systems Science and Complexity (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11424-010-0211-2
05C82: Small world graphs, complex networks (graph-theoretic aspects)
05C15: Coloring of graphs and hypergraphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Edge covering coloring and fractional edge covering coloring
- Some sufficient conditions for a graph to be of \(C_f\) 1
- \(f\)-colorings of some graphs of \(f\)-class 1
- A note on the \((g, f)\)-coloring
- Acyclic edge colouring of planar graphs without short cycles
- About acyclic edge colourings of planar graphs
- Edge covered critical multigraphs
- A note on the edge cover chromatic index of multigraphs
- Acyclic edge coloring of planar graphs with large girth
- Acyclic edge colorings of planar graphs and series parallel graphs
- Note to the paper of Grünbaum on acyclic colorings
- On acyclic colorings of planar graphs
- A sufficient condition for equitable edge-colourings of simple graphs
- Algorithmic aspects of acyclic edge colorings
- On the fg-coloring of graphs
- Improved bounds on acyclic edge colouring
- \((r,r+1)\)-factorizations of \((d,d+1)\)-graphs
- Some graphs of class 1 for \(f\)-colorings
- The classification of complete graphs \(K_n\) on \(f\)-coloring
- Acyclic edge colorings of graphs
- Acyclic edge chromatic number of outerplanar graphs
- Some Topics on Edge-Coloring
- A generalization of edge-coloring in graphs
- Scheduling File Transfers
- On the f-coloring of multigraphs
- Acyclic coloring of graphs
- On decompositions of a multi-graph into spanning subgraphs
- Colouring the Edges of a Multigraph so that Each Vertex has at Most j , or at Least j , Edges of Each Colour on it
- Some results about f‐critical graphs
- On the acyclic choosability of graphs
- What Color Is Your Jacobian? Graph Coloring for Computing Derivatives
- Acyclic colorings of planar graphs
