A note on semi-coloring of graphs

DOI10.1007/S00373-012-1171-1MaRDI QIDQ354428zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

matchingedge coloringfactorsemi-coloring

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

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

Cites work

• scientific article; zbMATH DE number 3855160 (Why is no real title available?)
• scientific article; zbMATH DE number 1131873 (Why is no real title available?)
• Factors and factorizations of graphs—a survey
• Graph factors and factorization: 1985--2003: a survey
• The 1-Factors of Oriented Graphs
• The Factors of Graphs
• Tight products and graph expansion
• Über die Zerlegung regulärer Streckenkomplexe ungerader

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)