Pages that link to "Item:Q4261182"

The following pages link to The edge chromatic number of a directed/mixed multigraph (Q4261182):

Displaying 13 items.

• A polynomial-time algorithm for the preemptive mixed-shop problem with two unit operations per job (Q283266) (← links)
• The Laplacian spectrum of a mixed graph (Q697039) (← links)
• On spectral integral variations of mixed graphs (Q1414166) (← links)
• Proof of Melnikov-Vizing conjecture for multigraphs with maximum degree at most \(3\) (Q1584243) (← links)
• The incidentor coloring of multigraphs and its applications (Q1613375) (← links)
• Largest eigenvalue of a unicyclic mixed graphs (Q1764382) (← links)
• The Laplacian eigenvalues of mixed graphs (Q1863571) (← links)
• First eigenvalue of nonsingular mixed graphs with given number of pendant vertices (Q2350298) (← links)
• A complete 4-parametric complexity classification of short shop scheduling problems (Q2434295) (← links)
• Complete Complexity Classification of Short Shop Scheduling (Q3392957) (← links)
• On eigenvectors of mixed graphs with exactly one nonsingular cycle (Q3618015) (← links)
• (Q5134442) (← links)
• On (1,l)-coloring of incidentors of multigraphs (Q5374008) (← links)