A note on semi-coloring of graphs
From MaRDI portal
Publication:354428
DOI10.1007/S00373-012-1171-1zbMATH Open1268.05088OpenAlexW1969494513MaRDI QIDQ354428FDOQ354428
Authors: Baoyindureng Wu, Xinhui An, Xingchao Deng, Guiying Yan 
Publication date: 19 July 2013
Published in: Graphs and Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00373-012-1171-1
Recommendations
- The existence of semi-colorings in a graph
- scientific article; zbMATH DE number 798646
- Semistrong edge coloring of graphs
- A note on graph colouring
- A NOTE ON COLOURING OF COMPLETE GRAPHS
- A note on pseudocomplete coloring of graphs
- Semi-algebraic colorings of complete graphs
- Colouring Semirandom Graphs
- Coloring of complete semigraphs
- A note on semi bound graphs
Coloring of graphs and hypergraphs (05C15) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Cites Work
- Title not available (Why is that?)
- The 1-Factors of Oriented Graphs
- Factors and factorizations of graphs—a survey
- The Factors of Graphs
- Über die Zerlegung regulärer Streckenkomplexe ungerader
- Tight products and graph expansion
- Title not available (Why is that?)
- Graph factors and factorization: 1985--2003: a survey
Cited In (6)
- Semi-balanced colorings of graphs: Generalized 2-colorings based on a relaxed discrepancy condition
- On local and semi-matching colorings of split graphs
- A note on the colour class of a self-complementary graph
- The semi-chromatic number of a graph
- The existence of semi-colorings in a graph
- Semi-strong chromatic number of a graph
This page was built for publication: A note on semi-coloring of graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q354428)
