Mathematical Research Data Initiative
Main page
Recent changes
Random page
SPARQL
MaRDI@GitHub
New item
Special pages
In other projects
MaRDI portal item
Discussion
View source
View history
English
Log in

The edge-cochromatic number of bipartite graph

From MaRDI portal
Publication:3610620
Jump to:navigation, search

zbMATH Open1174.05367MaRDI QIDQ3610620FDOQ3610620


Authors: Haipeng Liang, Xinsheng Liu Edit this on Wikidata


Publication date: 6 March 2009





Recommendations

  • Edge-Coloring Bipartite Graphs
  • Algorithms for edge coloring bipartite graphs
  • Edge coloring nearly bipartite graphs
  • Edge-coloring almost bipartite multigraphs
  • On the edge colouring of bipartite graphs


zbMATH Keywords

complete bipartite graph\( k\)-regular bipartite graphcomplete \( k\)-partite graphThe edge-cochromatic number


Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Coloring of graphs and hypergraphs (05C15)



Cited In (2)

  • Edge-Coloring Bipartite Graphs
  • Algorithm for identifying \((2,2)\)-bipartite graphs





This page was built for publication: The edge-cochromatic number of bipartite graph

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3610620)

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:3610620&oldid=17034985"
Tools
What links here
Related changes
Printable version
Permanent link
Page information
This page was last edited on 5 February 2024, at 04:13. Warning: Page may not contain recent updates.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki